./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc 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_multiply_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 295e238f3d082836e350ba49d0bd72376532101eb7ff98fb62c39e511a7670c1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 11:59:14,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 11:59:14,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 11:59:14,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 11:59:14,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 11:59:14,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 11:59:14,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 11:59:14,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 11:59:14,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 11:59:14,630 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 11:59:14,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 11:59:14,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 11:59:14,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 11:59:14,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 11:59:14,632 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 11:59:14,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 11:59:14,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 11:59:14,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 11:59:14,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 11:59:14,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 11:59:14,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 11:59:14,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 11:59:14,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 11:59:14,636 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 11:59:14,636 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 11:59:14,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 11:59:14,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 11:59:14,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 11:59:14,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 11:59:14,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 11:59:14,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 11:59:14,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:59:14,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 11:59:14,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 11:59:14,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 11:59:14,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 11:59:14,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 11:59:14,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 11:59:14,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 11:59:14,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 11:59:14,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 11:59:14,639 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 -> 295e238f3d082836e350ba49d0bd72376532101eb7ff98fb62c39e511a7670c1 [2024-11-19 11:59:14,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 11:59:14,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 11:59:14,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 11:59:14,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 11:59:14,857 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 11:59:14,857 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_multiply_12_bad.i [2024-11-19 11:59:16,062 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 11:59:16,297 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 11:59:16,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_12_bad.i [2024-11-19 11:59:16,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c21dd225/e179b552f69c46bea01b0f8f776251eb/FLAGf3832fe21 [2024-11-19 11:59:16,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c21dd225/e179b552f69c46bea01b0f8f776251eb [2024-11-19 11:59:16,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 11:59:16,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 11:59:16,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 11:59:16,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 11:59:16,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 11:59:16,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:59:16" (1/1) ... [2024-11-19 11:59:16,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe4fc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:16, skipping insertion in model container [2024-11-19 11:59:16,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:59:16" (1/1) ... [2024-11-19 11:59:16,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 11:59:16,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:59:17,000 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 11:59:17,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:59:17,166 INFO L204 MainTranslator]: Completed translation [2024-11-19 11:59:17,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:17 WrapperNode [2024-11-19 11:59:17,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 11:59:17,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 11:59:17,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 11:59:17,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 11:59:17,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:17" (1/1) ... [2024-11-19 11:59:17,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:17" (1/1) ... [2024-11-19 11:59:17,226 INFO L138 Inliner]: procedures = 498, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2024-11-19 11:59:17,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 11:59:17,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 11:59:17,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 11:59:17,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 11:59:17,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:17" (1/1) ... [2024-11-19 11:59:17,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:17" (1/1) ... [2024-11-19 11:59:17,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:17" (1/1) ... [2024-11-19 11:59:17,252 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-19 11:59:17,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:17" (1/1) ... [2024-11-19 11:59:17,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:17" (1/1) ... [2024-11-19 11:59:17,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:17" (1/1) ... [2024-11-19 11:59:17,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:17" (1/1) ... [2024-11-19 11:59:17,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:17" (1/1) ... [2024-11-19 11:59:17,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:17" (1/1) ... [2024-11-19 11:59:17,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 11:59:17,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 11:59:17,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 11:59:17,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 11:59:17,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:17" (1/1) ... [2024-11-19 11:59:17,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:59:17,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:59:17,290 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-19 11:59:17,292 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-19 11:59:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-19 11:59:17,325 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-19 11:59:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-19 11:59:17,326 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-19 11:59:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 11:59:17,326 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 11:59:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 11:59:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 11:59:17,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 11:59:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 11:59:17,433 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 11:59:17,435 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 11:59:17,571 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-19 11:59:17,572 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 11:59:17,585 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 11:59:17,585 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 11:59:17,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:59:17 BoogieIcfgContainer [2024-11-19 11:59:17,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 11:59:17,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 11:59:17,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 11:59:17,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 11:59:17,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:59:16" (1/3) ... [2024-11-19 11:59:17,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606f2104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:59:17, skipping insertion in model container [2024-11-19 11:59:17,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:17" (2/3) ... [2024-11-19 11:59:17,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606f2104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:59:17, skipping insertion in model container [2024-11-19 11:59:17,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:59:17" (3/3) ... [2024-11-19 11:59:17,592 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_12_bad.i [2024-11-19 11:59:17,604 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 11:59:17,605 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 11:59:17,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 11:59:17,656 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;@4ffa3ba9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 11:59:17,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 11:59:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 35 states have internal predecessors, (42), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 11:59:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 11:59:17,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:59:17,666 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:59:17,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 11:59:17,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:59:17,671 INFO L85 PathProgramCache]: Analyzing trace with hash 839271626, now seen corresponding path program 1 times [2024-11-19 11:59:17,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:59:17,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051254546] [2024-11-19 11:59:17,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:59:17,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:59:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:59:17,939 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-19 11:59:17,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:59:17,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051254546] [2024-11-19 11:59:17,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051254546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:59:17,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:59:17,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 11:59:17,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461917058] [2024-11-19 11:59:17,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:59:17,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:59:17,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:59:17,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:59:17,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:17,965 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 35 states have internal predecessors, (42), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-19 11:59:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:59:18,015 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2024-11-19 11:59:18,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:59:18,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 22 [2024-11-19 11:59:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:59:18,023 INFO L225 Difference]: With dead ends: 73 [2024-11-19 11:59:18,023 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 11:59:18,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:18,028 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:59:18,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:59:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 11:59:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-19 11:59:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 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-19 11:59:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-19 11:59:18,060 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2024-11-19 11:59:18,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:59:18,061 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-19 11:59:18,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-19 11:59:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-19 11:59:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 11:59:18,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:59:18,062 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:59:18,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 11:59:18,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 11:59:18,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:59:18,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2064452101, now seen corresponding path program 1 times [2024-11-19 11:59:18,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:59:18,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68643224] [2024-11-19 11:59:18,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:59:18,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:59:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:59:18,157 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-19 11:59:18,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:59:18,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68643224] [2024-11-19 11:59:18,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68643224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:59:18,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:59:18,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 11:59:18,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482223939] [2024-11-19 11:59:18,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:59:18,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:59:18,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:59:18,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:59:18,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:18,160 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-19 11:59:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:59:18,179 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-19 11:59:18,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:59:18,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 24 [2024-11-19 11:59:18,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:59:18,180 INFO L225 Difference]: With dead ends: 32 [2024-11-19 11:59:18,180 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 11:59:18,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:18,182 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:59:18,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 52 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:59:18,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 11:59:18,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-19 11:59:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:59:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-19 11:59:18,187 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 24 [2024-11-19 11:59:18,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:59:18,187 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-19 11:59:18,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-19 11:59:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-19 11:59:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 11:59:18,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:59:18,191 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:59:18,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 11:59:18,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 11:59:18,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:59:18,191 INFO L85 PathProgramCache]: Analyzing trace with hash -426494234, now seen corresponding path program 1 times [2024-11-19 11:59:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:59:18,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547607742] [2024-11-19 11:59:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:59:18,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:59:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 11:59:18,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 11:59:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 11:59:18,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 11:59:18,269 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 11:59:18,271 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-19 11:59:18,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-19 11:59:18,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-19 11:59:18,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-19 11:59:18,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 11:59:18,276 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 11:59:18,299 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 11:59:18,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:59:18 BoogieIcfgContainer [2024-11-19 11:59:18,311 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 11:59:18,312 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 11:59:18,312 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 11:59:18,312 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 11:59:18,312 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:59:17" (3/4) ... [2024-11-19 11:59:18,314 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 11:59:18,316 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 11:59:18,318 INFO L158 Benchmark]: Toolchain (without parser) took 1979.14ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 87.2MB in the beginning and 159.0MB in the end (delta: -71.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:59:18,318 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:59:18,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 826.53ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 86.9MB in the beginning and 126.5MB in the end (delta: -39.6MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2024-11-19 11:59:18,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.33ms. Allocated memory is still 195.0MB. Free memory was 126.5MB in the beginning and 124.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 11:59:18,322 INFO L158 Benchmark]: Boogie Preprocessor took 34.56ms. Allocated memory is still 195.0MB. Free memory was 124.4MB in the beginning and 121.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 11:59:18,322 INFO L158 Benchmark]: RCFGBuilder took 323.51ms. Allocated memory is still 195.0MB. Free memory was 121.3MB in the beginning and 106.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 11:59:18,322 INFO L158 Benchmark]: TraceAbstraction took 724.54ms. Allocated memory is still 195.0MB. Free memory was 105.5MB in the beginning and 159.0MB in the end (delta: -53.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-19 11:59:18,323 INFO L158 Benchmark]: Witness Printer took 5.50ms. Allocated memory is still 195.0MB. Free memory was 159.0MB in the beginning and 159.0MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:59:18,324 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 826.53ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 86.9MB in the beginning and 126.5MB in the end (delta: -39.6MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.33ms. Allocated memory is still 195.0MB. Free memory was 126.5MB in the beginning and 124.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.56ms. Allocated memory is still 195.0MB. Free memory was 124.4MB in the beginning and 121.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 323.51ms. Allocated memory is still 195.0MB. Free memory was 121.3MB in the beginning and 106.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 724.54ms. Allocated memory is still 195.0MB. Free memory was 105.5MB in the beginning and 159.0MB in the end (delta: -53.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Witness Printer took 5.50ms. Allocated memory is still 195.0MB. Free memory was 159.0MB in the beginning and 159.0MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1574]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1597, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1597] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1597] 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] [L1598] CALL CWE190_Integer_Overflow__int_fgets_multiply_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1572] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1574] data * 2 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: 1574]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 47 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 79 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 56 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 11:59:18,354 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_multiply_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 295e238f3d082836e350ba49d0bd72376532101eb7ff98fb62c39e511a7670c1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 11:59:20,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 11:59:20,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-19 11:59:20,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 11:59:20,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 11:59:20,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-19 11:59:20,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 11:59:20,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 11:59:20,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 11:59:20,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 11:59:20,152 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 11:59:20,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 11:59:20,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 11:59:20,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 11:59:20,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 11:59:20,154 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 11:59:20,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 11:59:20,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 11:59:20,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 11:59:20,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 11:59:20,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 11:59:20,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 11:59:20,157 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 11:59:20,158 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 11:59:20,159 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 11:59:20,159 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 11:59:20,159 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 11:59:20,159 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 11:59:20,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 11:59:20,160 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 11:59:20,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 11:59:20,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 11:59:20,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 11:59:20,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 11:59:20,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:59:20,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 11:59:20,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 11:59:20,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 11:59:20,161 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 11:59:20,161 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 11:59:20,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 11:59:20,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 11:59:20,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 11:59:20,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 11:59:20,164 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 -> 295e238f3d082836e350ba49d0bd72376532101eb7ff98fb62c39e511a7670c1 [2024-11-19 11:59:20,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 11:59:20,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 11:59:20,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 11:59:20,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 11:59:20,423 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 11:59:20,424 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_multiply_12_bad.i [2024-11-19 11:59:21,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 11:59:21,991 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 11:59:21,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_12_bad.i [2024-11-19 11:59:22,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e6d7bcd3/5f4b6f4328504c9990bbffff7fc4c9b5/FLAG6424ec68c [2024-11-19 11:59:22,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e6d7bcd3/5f4b6f4328504c9990bbffff7fc4c9b5 [2024-11-19 11:59:22,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 11:59:22,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 11:59:22,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 11:59:22,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 11:59:22,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 11:59:22,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d10e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22, skipping insertion in model container [2024-11-19 11:59:22,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 11:59:22,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:59:22,620 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 11:59:22,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:59:22,807 INFO L204 MainTranslator]: Completed translation [2024-11-19 11:59:22,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22 WrapperNode [2024-11-19 11:59:22,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 11:59:22,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 11:59:22,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 11:59:22,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 11:59:22,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,860 INFO L138 Inliner]: procedures = 503, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-19 11:59:22,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 11:59:22,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 11:59:22,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 11:59:22,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 11:59:22,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,898 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-19 11:59:22,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 11:59:22,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 11:59:22,911 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 11:59:22,911 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 11:59:22,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:59:22,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:59:22,954 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-19 11:59:22,957 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-19 11:59:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-19 11:59:22,990 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-19 11:59:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-19 11:59:22,990 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-19 11:59:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 11:59:22,990 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 11:59:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 11:59:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 11:59:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 11:59:22,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 11:59:23,111 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 11:59:23,112 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 11:59:23,278 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-19 11:59:23,278 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 11:59:23,289 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 11:59:23,290 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 11:59:23,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:59:23 BoogieIcfgContainer [2024-11-19 11:59:23,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 11:59:23,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 11:59:23,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 11:59:23,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 11:59:23,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:59:22" (1/3) ... [2024-11-19 11:59:23,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27375e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:59:23, skipping insertion in model container [2024-11-19 11:59:23,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22" (2/3) ... [2024-11-19 11:59:23,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27375e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:59:23, skipping insertion in model container [2024-11-19 11:59:23,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:59:23" (3/3) ... [2024-11-19 11:59:23,298 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_12_bad.i [2024-11-19 11:59:23,329 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 11:59:23,329 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 11:59:23,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 11:59:23,388 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;@6a328c0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 11:59:23,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 11:59:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 33 states have internal predecessors, (40), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 11:59:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 11:59:23,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:59:23,398 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:59:23,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 11:59:23,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:59:23,404 INFO L85 PathProgramCache]: Analyzing trace with hash -687868094, now seen corresponding path program 1 times [2024-11-19 11:59:23,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 11:59:23,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281790924] [2024-11-19 11:59:23,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:59:23,415 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-19 11:59:23,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 11:59:23,418 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-19 11:59:23,419 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-19 11:59:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:59:23,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 11:59:23,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:59:23,569 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-19 11:59:23,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:59:23,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 11:59:23,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281790924] [2024-11-19 11:59:23,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281790924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:59:23,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:59:23,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 11:59:23,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505135215] [2024-11-19 11:59:23,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:59:23,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:59:23,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 11:59:23,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:59:23,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:23,595 INFO L87 Difference]: Start difference. First operand has 45 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 33 states have internal predecessors, (40), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 11:59:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:59:23,655 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2024-11-19 11:59:23,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:59:23,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-19 11:59:23,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:59:23,663 INFO L225 Difference]: With dead ends: 70 [2024-11-19 11:59:23,664 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 11:59:23,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:23,670 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 5 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:59:23,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 97 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:59:23,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 11:59:23,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-19 11:59:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:59:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-19 11:59:23,699 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 20 [2024-11-19 11:59:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:59:23,700 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-19 11:59:23,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 11:59:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-19 11:59:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 11:59:23,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:59:23,702 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:59:23,708 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-19 11:59:23,906 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-19 11:59:23,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 11:59:23,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:59:23,907 INFO L85 PathProgramCache]: Analyzing trace with hash 614120967, now seen corresponding path program 1 times [2024-11-19 11:59:23,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 11:59:23,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657603986] [2024-11-19 11:59:23,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:59:23,907 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-19 11:59:23,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 11:59:23,910 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-19 11:59:23,911 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-19 11:59:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:59:24,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 11:59:24,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:59:24,021 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-19 11:59:24,021 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:59:24,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 11:59:24,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657603986] [2024-11-19 11:59:24,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657603986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:59:24,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:59:24,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 11:59:24,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608654232] [2024-11-19 11:59:24,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:59:24,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:59:24,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 11:59:24,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:59:24,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:24,024 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-19 11:59:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:59:24,050 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-19 11:59:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:59:24,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 22 [2024-11-19 11:59:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:59:24,051 INFO L225 Difference]: With dead ends: 30 [2024-11-19 11:59:24,052 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 11:59:24,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:24,053 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:59:24,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 48 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:59:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 11:59:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-19 11:59:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:59:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-19 11:59:24,057 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2024-11-19 11:59:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:59:24,057 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-19 11:59:24,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-19 11:59:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-19 11:59:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 11:59:24,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:59:24,058 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:59:24,062 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-19 11:59:24,261 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-19 11:59:24,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 11:59:24,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:59:24,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1857880866, now seen corresponding path program 1 times [2024-11-19 11:59:24,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 11:59:24,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858342619] [2024-11-19 11:59:24,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:59:24,263 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-19 11:59:24,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 11:59:24,266 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-19 11:59:24,269 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-19 11:59:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 11:59:24,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 11:59:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 11:59:24,373 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 11:59:24,374 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 11:59:24,375 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-19 11:59:24,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-19 11:59:24,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-19 11:59:24,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-19 11:59:24,388 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-19 11:59:24,579 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-19 11:59:24,583 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 11:59:24,603 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 11:59:24,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:59:24 BoogieIcfgContainer [2024-11-19 11:59:24,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 11:59:24,605 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 11:59:24,605 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 11:59:24,606 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 11:59:24,606 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:59:23" (3/4) ... [2024-11-19 11:59:24,607 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 11:59:24,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 11:59:24,609 INFO L158 Benchmark]: Toolchain (without parser) took 2576.24ms. Allocated memory was 65.0MB in the beginning and 109.1MB in the end (delta: 44.0MB). Free memory was 38.2MB in the beginning and 60.7MB in the end (delta: -22.5MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-11-19 11:59:24,609 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 65.0MB. Free memory was 41.8MB in the beginning and 41.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:59:24,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 773.94ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 38.1MB in the beginning and 54.5MB in the end (delta: -16.5MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2024-11-19 11:59:24,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.34ms. Allocated memory is still 86.0MB. Free memory was 54.5MB in the beginning and 51.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 11:59:24,610 INFO L158 Benchmark]: Boogie Preprocessor took 48.73ms. Allocated memory is still 86.0MB. Free memory was 51.4MB in the beginning and 48.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 11:59:24,610 INFO L158 Benchmark]: RCFGBuilder took 379.62ms. Allocated memory is still 86.0MB. Free memory was 48.3MB in the beginning and 32.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 11:59:24,610 INFO L158 Benchmark]: TraceAbstraction took 1313.26ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 31.0MB in the beginning and 60.7MB in the end (delta: -29.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:59:24,611 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 109.1MB. Free memory is still 60.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:59:24,613 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.74ms. Allocated memory is still 65.0MB. Free memory was 41.8MB in the beginning and 41.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 773.94ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 38.1MB in the beginning and 54.5MB in the end (delta: -16.5MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.34ms. Allocated memory is still 86.0MB. Free memory was 54.5MB in the beginning and 51.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.73ms. Allocated memory is still 86.0MB. Free memory was 51.4MB in the beginning and 48.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 379.62ms. Allocated memory is still 86.0MB. Free memory was 48.3MB in the beginning and 32.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1313.26ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 31.0MB in the beginning and 60.7MB in the end (delta: -29.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 109.1MB. Free memory is still 60.7MB. 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: 1574]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1597, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1597] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1597] 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] [L1598] CALL CWE190_Integer_Overflow__int_fgets_multiply_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1572] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1574] data * 2 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: 1574]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 145 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 85 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 50 SizeOfPredicates, 0 NumberOfNonLiveVariables, 141 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-19 11:59:24,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample