./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f9ab0f28220d4c56d024e1d051466cfff21d1d545d8edb81faa19718425e9629 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 21:31:01,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 21:31:01,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-24 21:31:01,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 21:31:01,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 21:31:01,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 21:31:01,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 21:31:01,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 21:31:01,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 21:31:01,630 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 21:31:01,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 21:31:01,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 21:31:01,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 21:31:01,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 21:31:01,635 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 21:31:01,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 21:31:01,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 21:31:01,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 21:31:01,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 21:31:01,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 21:31:01,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 21:31:01,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 21:31:01,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 21:31:01,642 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 21:31:01,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 21:31:01,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 21:31:01,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 21:31:01,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 21:31:01,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 21:31:01,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 21:31:01,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 21:31:01,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:31:01,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 21:31:01,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 21:31:01,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 21:31:01,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 21:31:01,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 21:31:01,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 21:31:01,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 21:31:01,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 21:31:01,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 21:31:01,649 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f9ab0f28220d4c56d024e1d051466cfff21d1d545d8edb81faa19718425e9629 [2024-10-24 21:31:01,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 21:31:01,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 21:31:01,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 21:31:01,987 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 21:31:01,987 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 21:31:01,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_12_bad.i [2024-10-24 21:31:03,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 21:31:03,762 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 21:31:03,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_12_bad.i [2024-10-24 21:31:03,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a50545e6/4996f186f2b0458cb4f3c2d19ddabfdd/FLAG746a4659a [2024-10-24 21:31:03,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a50545e6/4996f186f2b0458cb4f3c2d19ddabfdd [2024-10-24 21:31:03,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 21:31:03,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 21:31:03,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 21:31:03,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 21:31:03,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 21:31:03,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:31:03" (1/1) ... [2024-10-24 21:31:03,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b612e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:03, skipping insertion in model container [2024-10-24 21:31:03,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:31:03" (1/1) ... [2024-10-24 21:31:03,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 21:31:04,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:31:04,581 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 21:31:04,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:31:04,769 INFO L204 MainTranslator]: Completed translation [2024-10-24 21:31:04,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:04 WrapperNode [2024-10-24 21:31:04,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 21:31:04,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 21:31:04,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 21:31:04,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 21:31:04,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:04" (1/1) ... [2024-10-24 21:31:04,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:04" (1/1) ... [2024-10-24 21:31:04,839 INFO L138 Inliner]: procedures = 498, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2024-10-24 21:31:04,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 21:31:04,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 21:31:04,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 21:31:04,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 21:31:04,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:04" (1/1) ... [2024-10-24 21:31:04,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:04" (1/1) ... [2024-10-24 21:31:04,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:04" (1/1) ... [2024-10-24 21:31:04,872 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-10-24 21:31:04,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:04" (1/1) ... [2024-10-24 21:31:04,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:04" (1/1) ... [2024-10-24 21:31:04,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:04" (1/1) ... [2024-10-24 21:31:04,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:04" (1/1) ... [2024-10-24 21:31:04,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:04" (1/1) ... [2024-10-24 21:31:04,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:04" (1/1) ... [2024-10-24 21:31:04,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 21:31:04,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 21:31:04,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 21:31:04,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 21:31:04,891 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:04" (1/1) ... [2024-10-24 21:31:04,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:31:04,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 21:31:04,930 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-10-24 21:31:04,934 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-10-24 21:31:04,983 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-24 21:31:04,983 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-24 21:31:04,983 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-10-24 21:31:04,983 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-10-24 21:31:04,983 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 21:31:04,984 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 21:31:04,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 21:31:04,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 21:31:04,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 21:31:04,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 21:31:05,156 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 21:31:05,158 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 21:31:05,298 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-24 21:31:05,298 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 21:31:05,342 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 21:31:05,342 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 21:31:05,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:31:05 BoogieIcfgContainer [2024-10-24 21:31:05,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 21:31:05,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 21:31:05,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 21:31:05,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 21:31:05,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:31:03" (1/3) ... [2024-10-24 21:31:05,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3e0e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:31:05, skipping insertion in model container [2024-10-24 21:31:05,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:04" (2/3) ... [2024-10-24 21:31:05,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3e0e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:31:05, skipping insertion in model container [2024-10-24 21:31:05,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:31:05" (3/3) ... [2024-10-24 21:31:05,355 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_12_bad.i [2024-10-24 21:31:05,370 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 21:31:05,370 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-24 21:31:05,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 21:31:05,427 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;@3d374479, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 21:31:05,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-24 21:31:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 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-10-24 21:31:05,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 21:31:05,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:31:05,440 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:31:05,440 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-10-24 21:31:05,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:31:05,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1337498024, now seen corresponding path program 1 times [2024-10-24 21:31:05,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:31:05,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070751120] [2024-10-24 21:31:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:31:05,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:31:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:31:05,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 21:31:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:31:05,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 21:31:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:31:05,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 21:31:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:31:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 21:31:05,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 21:31:05,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070751120] [2024-10-24 21:31:05,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070751120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:31:05,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:31:05,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 21:31:05,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109284658] [2024-10-24 21:31:05,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:31:05,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 21:31:05,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 21:31:05,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 21:31:05,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:31:05,892 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 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 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-10-24 21:31:05,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:31:05,969 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2024-10-24 21:31:05,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 21:31:05,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 18 [2024-10-24 21:31:05,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:31:05,979 INFO L225 Difference]: With dead ends: 62 [2024-10-24 21:31:05,979 INFO L226 Difference]: Without dead ends: 28 [2024-10-24 21:31:05,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:31:05,988 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 21:31:05,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 21:31:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-24 21:31:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-24 21:31:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2777777777777777) 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-10-24 21:31:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-10-24 21:31:06,028 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2024-10-24 21:31:06,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:31:06,031 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-10-24 21:31:06,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-10-24 21:31:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-10-24 21:31:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 21:31:06,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:31:06,033 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:31:06,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 21:31:06,034 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-10-24 21:31:06,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:31:06,035 INFO L85 PathProgramCache]: Analyzing trace with hash 272896547, now seen corresponding path program 1 times [2024-10-24 21:31:06,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:31:06,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645751087] [2024-10-24 21:31:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:31:06,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:31:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:31:06,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 21:31:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:31:06,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 21:31:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:31:06,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 21:31:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:31:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 21:31:06,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 21:31:06,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645751087] [2024-10-24 21:31:06,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645751087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:31:06,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:31:06,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 21:31:06,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651337477] [2024-10-24 21:31:06,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:31:06,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 21:31:06,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 21:31:06,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 21:31:06,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:31:06,209 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 21:31:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:31:06,236 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-10-24 21:31:06,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 21:31:06,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-10-24 21:31:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:31:06,238 INFO L225 Difference]: With dead ends: 28 [2024-10-24 21:31:06,238 INFO L226 Difference]: Without dead ends: 26 [2024-10-24 21:31:06,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:31:06,240 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:31:06,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 31 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:31:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-24 21:31:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-24 21:31:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 21:31:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-10-24 21:31:06,249 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2024-10-24 21:31:06,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:31:06,249 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-10-24 21:31:06,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 21:31:06,249 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-10-24 21:31:06,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 21:31:06,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:31:06,251 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:31:06,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 21:31:06,251 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-10-24 21:31:06,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:31:06,252 INFO L85 PathProgramCache]: Analyzing trace with hash -130141563, now seen corresponding path program 1 times [2024-10-24 21:31:06,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:31:06,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270909672] [2024-10-24 21:31:06,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:31:06,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:31:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:31:06,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 21:31:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:31:06,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 21:31:06,348 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 21:31:06,349 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-24 21:31:06,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-24 21:31:06,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-24 21:31:06,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-24 21:31:06,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 21:31:06,361 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 21:31:06,391 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 21:31:06,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:31:06 BoogieIcfgContainer [2024-10-24 21:31:06,394 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 21:31:06,395 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 21:31:06,395 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 21:31:06,395 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 21:31:06,395 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:31:05" (3/4) ... [2024-10-24 21:31:06,397 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 21:31:06,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 21:31:06,398 INFO L158 Benchmark]: Toolchain (without parser) took 2587.38ms. Allocated memory is still 159.4MB. Free memory was 81.4MB in the beginning and 56.1MB in the end (delta: 25.4MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-10-24 21:31:06,399 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:31:06,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 956.72ms. Allocated memory is still 159.4MB. Free memory was 81.4MB in the beginning and 76.7MB in the end (delta: 4.7MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-10-24 21:31:06,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.92ms. Allocated memory is still 159.4MB. Free memory was 76.7MB in the beginning and 74.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:31:06,400 INFO L158 Benchmark]: Boogie Preprocessor took 48.29ms. Allocated memory is still 159.4MB. Free memory was 74.6MB in the beginning and 72.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:31:06,400 INFO L158 Benchmark]: RCFGBuilder took 453.44ms. Allocated memory is still 159.4MB. Free memory was 71.3MB in the beginning and 113.7MB in the end (delta: -42.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 21:31:06,401 INFO L158 Benchmark]: TraceAbstraction took 1049.75ms. Allocated memory is still 159.4MB. Free memory was 112.7MB in the beginning and 56.1MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-10-24 21:31:06,401 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 159.4MB. Free memory was 56.1MB in the beginning and 56.1MB in the end (delta: 56B). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:31:06,403 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.22ms. Allocated memory is still 159.4MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 956.72ms. Allocated memory is still 159.4MB. Free memory was 81.4MB in the beginning and 76.7MB in the end (delta: 4.7MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.92ms. Allocated memory is still 159.4MB. Free memory was 76.7MB in the beginning and 74.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.29ms. Allocated memory is still 159.4MB. Free memory was 74.6MB in the beginning and 72.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 453.44ms. Allocated memory is still 159.4MB. Free memory was 71.3MB in the beginning and 113.7MB in the end (delta: -42.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1049.75ms. Allocated memory is still 159.4MB. Free memory was 112.7MB in the beginning and 56.1MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 159.4MB. Free memory was 56.1MB in the beginning and 56.1MB in the end (delta: 56B). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1593, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1593] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1593] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1594] CALL CWE190_Integer_Overflow__int_fgets_add_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 62 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 4/4 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-10-24 21:31:06,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f9ab0f28220d4c56d024e1d051466cfff21d1d545d8edb81faa19718425e9629 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 21:31:08,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 21:31:08,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-24 21:31:08,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 21:31:08,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 21:31:08,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-24 21:31:08,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 21:31:08,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 21:31:08,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 21:31:08,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 21:31:08,761 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 21:31:08,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 21:31:08,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 21:31:08,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 21:31:08,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 21:31:08,765 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 21:31:08,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 21:31:08,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 21:31:08,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 21:31:08,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 21:31:08,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 21:31:08,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 21:31:08,770 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 21:31:08,770 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 21:31:08,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 21:31:08,771 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 21:31:08,771 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 21:31:08,771 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 21:31:08,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 21:31:08,772 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 21:31:08,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 21:31:08,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 21:31:08,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 21:31:08,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 21:31:08,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:31:08,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 21:31:08,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 21:31:08,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 21:31:08,775 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 21:31:08,775 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 21:31:08,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 21:31:08,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 21:31:08,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 21:31:08,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 21:31:08,777 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 21:31:08,777 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f9ab0f28220d4c56d024e1d051466cfff21d1d545d8edb81faa19718425e9629 [2024-10-24 21:31:09,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 21:31:09,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 21:31:09,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 21:31:09,104 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 21:31:09,106 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 21:31:09,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_12_bad.i [2024-10-24 21:31:10,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 21:31:10,989 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 21:31:10,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_12_bad.i [2024-10-24 21:31:11,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c994793/ae6e27fe94134bbba9e75f5f9c95d5a7/FLAGc3da34722 [2024-10-24 21:31:11,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c994793/ae6e27fe94134bbba9e75f5f9c95d5a7 [2024-10-24 21:31:11,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 21:31:11,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 21:31:11,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 21:31:11,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 21:31:11,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 21:31:11,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:31:11" (1/1) ... [2024-10-24 21:31:11,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62894f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:11, skipping insertion in model container [2024-10-24 21:31:11,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:31:11" (1/1) ... [2024-10-24 21:31:11,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 21:31:12,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:31:12,157 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 21:31:12,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:31:12,382 INFO L204 MainTranslator]: Completed translation [2024-10-24 21:31:12,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:12 WrapperNode [2024-10-24 21:31:12,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 21:31:12,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 21:31:12,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 21:31:12,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 21:31:12,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:12" (1/1) ... [2024-10-24 21:31:12,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:12" (1/1) ... [2024-10-24 21:31:12,448 INFO L138 Inliner]: procedures = 503, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-10-24 21:31:12,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 21:31:12,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 21:31:12,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 21:31:12,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 21:31:12,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:12" (1/1) ... [2024-10-24 21:31:12,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:12" (1/1) ... [2024-10-24 21:31:12,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:12" (1/1) ... [2024-10-24 21:31:12,486 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-10-24 21:31:12,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:12" (1/1) ... [2024-10-24 21:31:12,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:12" (1/1) ... [2024-10-24 21:31:12,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:12" (1/1) ... [2024-10-24 21:31:12,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:12" (1/1) ... [2024-10-24 21:31:12,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:12" (1/1) ... [2024-10-24 21:31:12,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:12" (1/1) ... [2024-10-24 21:31:12,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 21:31:12,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 21:31:12,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 21:31:12,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 21:31:12,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:12" (1/1) ... [2024-10-24 21:31:12,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:31:12,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 21:31:12,553 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-10-24 21:31:12,560 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-10-24 21:31:12,597 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-24 21:31:12,597 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-24 21:31:12,597 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-10-24 21:31:12,597 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-10-24 21:31:12,598 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 21:31:12,598 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 21:31:12,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 21:31:12,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 21:31:12,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 21:31:12,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 21:31:12,762 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 21:31:12,764 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 21:31:12,970 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 21:31:12,970 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 21:31:13,011 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 21:31:13,011 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 21:31:13,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:31:13 BoogieIcfgContainer [2024-10-24 21:31:13,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 21:31:13,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 21:31:13,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 21:31:13,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 21:31:13,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:31:11" (1/3) ... [2024-10-24 21:31:13,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbbba58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:31:13, skipping insertion in model container [2024-10-24 21:31:13,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:31:12" (2/3) ... [2024-10-24 21:31:13,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbbba58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:31:13, skipping insertion in model container [2024-10-24 21:31:13,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:31:13" (3/3) ... [2024-10-24 21:31:13,022 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_12_bad.i [2024-10-24 21:31:13,038 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 21:31:13,039 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-24 21:31:13,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 21:31:13,111 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;@7fd38ae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 21:31:13,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-24 21:31:13,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 26 states have internal predecessors, (31), 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-10-24 21:31:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 21:31:13,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:31:13,123 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:31:13,123 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-10-24 21:31:13,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:31:13,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1066203022, now seen corresponding path program 1 times [2024-10-24 21:31:13,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:31:13,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957088917] [2024-10-24 21:31:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:31:13,147 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-10-24 21:31:13,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:31:13,150 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-10-24 21:31:13,151 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-10-24 21:31:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:31:13,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 21:31:13,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 21:31:13,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 21:31:13,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 21:31:13,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 21:31:13,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957088917] [2024-10-24 21:31:13,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957088917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:31:13,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:31:13,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 21:31:13,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17084882] [2024-10-24 21:31:13,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:31:13,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 21:31:13,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 21:31:13,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 21:31:13,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 21:31:13,325 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 26 states have internal predecessors, (31), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 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-10-24 21:31:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:31:13,356 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-10-24 21:31:13,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 21:31:13,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 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 16 [2024-10-24 21:31:13,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:31:13,366 INFO L225 Difference]: With dead ends: 38 [2024-10-24 21:31:13,366 INFO L226 Difference]: Without dead ends: 24 [2024-10-24 21:31:13,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 21:31:13,373 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:31:13,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:31:13,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-24 21:31:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-24 21:31:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 21:31:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-24 21:31:13,412 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2024-10-24 21:31:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:31:13,413 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-24 21:31:13,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 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-10-24 21:31:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-24 21:31:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 21:31:13,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:31:13,415 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:31:13,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 21:31:13,619 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-10-24 21:31:13,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 21:31:13,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:31:13,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1307444756, now seen corresponding path program 1 times [2024-10-24 21:31:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:31:13,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722832276] [2024-10-24 21:31:13,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:31:13,621 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-10-24 21:31:13,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:31:13,625 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-10-24 21:31:13,626 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-10-24 21:31:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:31:13,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 21:31:13,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 21:31:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 21:31:13,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 21:31:13,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 21:31:13,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722832276] [2024-10-24 21:31:13,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722832276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:31:13,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:31:13,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 21:31:13,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947595825] [2024-10-24 21:31:13,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:31:13,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 21:31:13,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 21:31:13,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 21:31:13,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:31:13,748 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-10-24 21:31:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:31:13,785 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-10-24 21:31:13,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 21:31:13,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 17 [2024-10-24 21:31:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:31:13,788 INFO L225 Difference]: With dead ends: 33 [2024-10-24 21:31:13,788 INFO L226 Difference]: Without dead ends: 24 [2024-10-24 21:31:13,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-10-24 21:31:13,789 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:31:13,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 41 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:31:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-24 21:31:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-24 21:31:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 21:31:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-10-24 21:31:13,799 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2024-10-24 21:31:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:31:13,799 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-24 21:31:13,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-10-24 21:31:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-10-24 21:31:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 21:31:13,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:31:13,801 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:31:13,807 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-10-24 21:31:14,006 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-10-24 21:31:14,007 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-10-24 21:31:14,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:31:14,008 INFO L85 PathProgramCache]: Analyzing trace with hash -211005393, now seen corresponding path program 1 times [2024-10-24 21:31:14,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:31:14,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471871639] [2024-10-24 21:31:14,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:31:14,008 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-10-24 21:31:14,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:31:14,012 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-10-24 21:31:14,013 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-10-24 21:31:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:31:14,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 21:31:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:31:14,125 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 21:31:14,126 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 21:31:14,127 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-24 21:31:14,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-24 21:31:14,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-24 21:31:14,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-24 21:31:14,141 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-10-24 21:31:14,335 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-10-24 21:31:14,338 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 21:31:14,379 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 21:31:14,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:31:14 BoogieIcfgContainer [2024-10-24 21:31:14,382 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 21:31:14,387 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 21:31:14,387 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 21:31:14,387 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 21:31:14,388 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:31:13" (3/4) ... [2024-10-24 21:31:14,394 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 21:31:14,399 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 21:31:14,400 INFO L158 Benchmark]: Toolchain (without parser) took 3173.92ms. Allocated memory was 67.1MB in the beginning and 107.0MB in the end (delta: 39.8MB). Free memory was 32.3MB in the beginning and 73.7MB in the end (delta: -41.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:31:14,400 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 50.3MB. Free memory is still 23.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:31:14,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1156.02ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 32.2MB in the beginning and 48.1MB in the end (delta: -15.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-10-24 21:31:14,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.66ms. Allocated memory is still 81.8MB. Free memory was 47.6MB in the beginning and 44.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:31:14,402 INFO L158 Benchmark]: Boogie Preprocessor took 66.53ms. Allocated memory is still 81.8MB. Free memory was 44.8MB in the beginning and 41.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 21:31:14,402 INFO L158 Benchmark]: RCFGBuilder took 496.40ms. Allocated memory is still 81.8MB. Free memory was 41.9MB in the beginning and 45.7MB in the end (delta: -3.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-10-24 21:31:14,402 INFO L158 Benchmark]: TraceAbstraction took 1367.85ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 45.0MB in the beginning and 74.1MB in the end (delta: -29.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-10-24 21:31:14,403 INFO L158 Benchmark]: Witness Printer took 12.71ms. Allocated memory is still 107.0MB. Free memory was 74.1MB in the beginning and 73.7MB in the end (delta: 358.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:31:14,413 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 50.3MB. Free memory is still 23.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1156.02ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 32.2MB in the beginning and 48.1MB in the end (delta: -15.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.66ms. Allocated memory is still 81.8MB. Free memory was 47.6MB in the beginning and 44.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.53ms. Allocated memory is still 81.8MB. Free memory was 44.8MB in the beginning and 41.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 496.40ms. Allocated memory is still 81.8MB. Free memory was 41.9MB in the beginning and 45.7MB in the end (delta: -3.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1367.85ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 45.0MB in the beginning and 74.1MB in the end (delta: -29.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Witness Printer took 12.71ms. Allocated memory is still 107.0MB. Free memory was 74.1MB in the beginning and 73.7MB in the end (delta: 358.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1593, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1593] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1593] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1594] CALL CWE190_Integer_Overflow__int_fgets_add_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 64 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 4/4 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-10-24 21:31:14,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample