./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_preinc_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_preinc_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b91dae833bbe914f6db858614925f2e5ed6a0d4828d26d06ca221fba91b27025 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 21:34:26,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 21:34:26,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-24 21:34:26,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 21:34:26,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 21:34:26,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 21:34:26,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 21:34:26,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 21:34:26,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 21:34:26,786 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 21:34:26,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 21:34:26,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 21:34:26,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 21:34:26,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 21:34:26,788 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 21:34:26,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 21:34:26,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 21:34:26,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 21:34:26,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 21:34:26,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 21:34:26,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 21:34:26,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 21:34:26,792 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 21:34:26,796 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 21:34:26,796 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 21:34:26,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 21:34:26,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 21:34:26,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 21:34:26,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 21:34:26,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 21:34:26,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 21:34:26,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:34:26,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 21:34:26,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 21:34:26,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 21:34:26,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 21:34:26,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 21:34:26,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 21:34:26,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 21:34:26,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 21:34:26,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 21:34:26,811 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b91dae833bbe914f6db858614925f2e5ed6a0d4828d26d06ca221fba91b27025 [2024-10-24 21:34:27,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 21:34:27,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 21:34:27,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 21:34:27,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 21:34:27,139 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 21:34:27,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2024-10-24 21:34:28,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 21:34:28,922 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 21:34:28,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2024-10-24 21:34:28,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484a0e84d/837740d83ad84d03b1a6b0b5bde0b63c/FLAGf8ec3a2ea [2024-10-24 21:34:28,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484a0e84d/837740d83ad84d03b1a6b0b5bde0b63c [2024-10-24 21:34:28,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 21:34:28,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 21:34:28,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 21:34:28,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 21:34:28,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 21:34:28,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:34:28" (1/1) ... [2024-10-24 21:34:28,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@773e24f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:28, skipping insertion in model container [2024-10-24 21:34:28,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:34:28" (1/1) ... [2024-10-24 21:34:29,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 21:34:29,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:34:29,732 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 21:34:29,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:34:29,988 INFO L204 MainTranslator]: Completed translation [2024-10-24 21:34:29,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:29 WrapperNode [2024-10-24 21:34:29,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 21:34:29,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 21:34:29,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 21:34:29,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 21:34:30,014 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:34:29" (1/1) ... [2024-10-24 21:34:30,044 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:34:29" (1/1) ... [2024-10-24 21:34:30,076 INFO L138 Inliner]: procedures = 498, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2024-10-24 21:34:30,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 21:34:30,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 21:34:30,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 21:34:30,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 21:34:30,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:29" (1/1) ... [2024-10-24 21:34:30,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:29" (1/1) ... [2024-10-24 21:34:30,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:29" (1/1) ... [2024-10-24 21:34:30,103 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:34:30,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:29" (1/1) ... [2024-10-24 21:34:30,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:29" (1/1) ... [2024-10-24 21:34:30,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:29" (1/1) ... [2024-10-24 21:34:30,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:29" (1/1) ... [2024-10-24 21:34:30,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:29" (1/1) ... [2024-10-24 21:34:30,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:29" (1/1) ... [2024-10-24 21:34:30,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 21:34:30,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 21:34:30,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 21:34:30,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 21:34:30,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:29" (1/1) ... [2024-10-24 21:34:30,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:34:30,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 21:34:30,155 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:34:30,158 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:34:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-24 21:34:30,202 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-24 21:34:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-10-24 21:34:30,202 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-10-24 21:34:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 21:34:30,203 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 21:34:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 21:34:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 21:34:30,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 21:34:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 21:34:30,383 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 21:34:30,385 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 21:34:30,552 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-24 21:34:30,552 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 21:34:30,583 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 21:34:30,583 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 21:34:30,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:34:30 BoogieIcfgContainer [2024-10-24 21:34:30,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 21:34:30,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 21:34:30,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 21:34:30,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 21:34:30,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:34:28" (1/3) ... [2024-10-24 21:34:30,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2872f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:34:30, skipping insertion in model container [2024-10-24 21:34:30,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:29" (2/3) ... [2024-10-24 21:34:30,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2872f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:34:30, skipping insertion in model container [2024-10-24 21:34:30,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:34:30" (3/3) ... [2024-10-24 21:34:30,595 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2024-10-24 21:34:30,612 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 21:34:30,613 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-24 21:34:30,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 21:34:30,683 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;@504603be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 21:34:30,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-24 21:34:30,688 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:34:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 21:34:30,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:34:30,696 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:34:30,697 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:34:30,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:34:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1337498024, now seen corresponding path program 1 times [2024-10-24 21:34:30,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:34:30,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991134730] [2024-10-24 21:34:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:34:30,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:34:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:34:31,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 21:34:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:34:31,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 21:34:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:34:31,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 21:34:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:34:31,110 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:34:31,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 21:34:31,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991134730] [2024-10-24 21:34:31,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991134730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:34:31,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:34:31,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 21:34:31,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349784567] [2024-10-24 21:34:31,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:34:31,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 21:34:31,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 21:34:31,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 21:34:31,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:34:31,146 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:34:31,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:34:31,242 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2024-10-24 21:34:31,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 21:34:31,245 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:34:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:34:31,251 INFO L225 Difference]: With dead ends: 62 [2024-10-24 21:34:31,252 INFO L226 Difference]: Without dead ends: 28 [2024-10-24 21:34:31,255 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:34:31,259 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:34:31,260 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:34:31,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-24 21:34:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-24 21:34:31,292 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:34:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-10-24 21:34:31,295 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2024-10-24 21:34:31,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:34:31,297 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-10-24 21:34:31,297 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:34:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-10-24 21:34:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 21:34:31,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:34:31,300 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:34:31,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 21:34:31,300 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:34:31,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:34:31,301 INFO L85 PathProgramCache]: Analyzing trace with hash 272896547, now seen corresponding path program 1 times [2024-10-24 21:34:31,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:34:31,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649642366] [2024-10-24 21:34:31,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:34:31,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:34:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:34:31,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 21:34:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:34:31,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 21:34:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:34:31,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 21:34:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:34:31,431 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:34:31,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 21:34:31,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649642366] [2024-10-24 21:34:31,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649642366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:34:31,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:34:31,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 21:34:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338193546] [2024-10-24 21:34:31,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:34:31,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 21:34:31,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 21:34:31,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 21:34:31,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:34:31,438 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:34:31,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:34:31,470 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-10-24 21:34:31,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 21:34:31,470 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:34:31,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:34:31,471 INFO L225 Difference]: With dead ends: 28 [2024-10-24 21:34:31,472 INFO L226 Difference]: Without dead ends: 26 [2024-10-24 21:34:31,472 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:34:31,474 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:34:31,475 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:34:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-24 21:34:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-24 21:34:31,482 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:34:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-10-24 21:34:31,484 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2024-10-24 21:34:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:34:31,484 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-10-24 21:34:31,484 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:34:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-10-24 21:34:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 21:34:31,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:34:31,486 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:34:31,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 21:34:31,487 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:34:31,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:34:31,489 INFO L85 PathProgramCache]: Analyzing trace with hash -130141563, now seen corresponding path program 1 times [2024-10-24 21:34:31,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:34:31,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36655264] [2024-10-24 21:34:31,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:34:31,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:34:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:34:31,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 21:34:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:34:31,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 21:34:31,576 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 21:34:31,577 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-24 21:34:31,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-24 21:34:31,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-24 21:34:31,580 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-24 21:34:31,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 21:34:31,583 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 21:34:31,614 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 21:34:31,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:34:31 BoogieIcfgContainer [2024-10-24 21:34:31,617 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 21:34:31,618 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 21:34:31,618 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 21:34:31,618 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 21:34:31,618 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:34:30" (3/4) ... [2024-10-24 21:34:31,620 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 21:34:31,621 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 21:34:31,622 INFO L158 Benchmark]: Toolchain (without parser) took 2646.07ms. Allocated memory was 157.3MB in the beginning and 218.1MB in the end (delta: 60.8MB). Free memory was 121.7MB in the beginning and 152.8MB in the end (delta: -31.1MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-10-24 21:34:31,623 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 157.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:34:31,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1011.66ms. Allocated memory is still 157.3MB. Free memory was 121.7MB in the beginning and 107.7MB in the end (delta: 14.0MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2024-10-24 21:34:31,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.69ms. Allocated memory is still 157.3MB. Free memory was 107.7MB in the beginning and 103.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 21:34:31,624 INFO L158 Benchmark]: Boogie Preprocessor took 42.42ms. Allocated memory is still 157.3MB. Free memory was 103.8MB in the beginning and 101.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:34:31,624 INFO L158 Benchmark]: RCFGBuilder took 462.86ms. Allocated memory is still 157.3MB. Free memory was 101.7MB in the beginning and 85.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 21:34:31,625 INFO L158 Benchmark]: TraceAbstraction took 1031.16ms. Allocated memory was 157.3MB in the beginning and 218.1MB in the end (delta: 60.8MB). Free memory was 85.0MB in the beginning and 153.8MB in the end (delta: -68.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:34:31,625 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 218.1MB. Free memory was 153.8MB in the beginning and 152.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:34:31,627 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.44ms. Allocated memory is still 157.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1011.66ms. Allocated memory is still 157.3MB. Free memory was 121.7MB in the beginning and 107.7MB in the end (delta: 14.0MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.69ms. Allocated memory is still 157.3MB. Free memory was 107.7MB in the beginning and 103.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.42ms. Allocated memory is still 157.3MB. Free memory was 103.8MB in the beginning and 101.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 462.86ms. Allocated memory is still 157.3MB. Free memory was 101.7MB in the beginning and 85.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1031.16ms. Allocated memory was 157.3MB in the beginning and 218.1MB in the end (delta: 60.8MB). Free memory was 85.0MB in the beginning and 153.8MB in the end (delta: -68.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 218.1MB. Free memory was 153.8MB in the beginning and 152.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1595, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1595] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1595] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1596] CALL CWE190_Integer_Overflow__int_fgets_preinc_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, 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.3s 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:34:31,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_preinc_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b91dae833bbe914f6db858614925f2e5ed6a0d4828d26d06ca221fba91b27025 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 21:34:33,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 21:34:33,964 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-24 21:34:33,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 21:34:33,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 21:34:33,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-24 21:34:34,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 21:34:34,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 21:34:34,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 21:34:34,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 21:34:34,002 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 21:34:34,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 21:34:34,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 21:34:34,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 21:34:34,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 21:34:34,004 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 21:34:34,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 21:34:34,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 21:34:34,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 21:34:34,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 21:34:34,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 21:34:34,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 21:34:34,006 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 21:34:34,007 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 21:34:34,007 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 21:34:34,007 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 21:34:34,007 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 21:34:34,008 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 21:34:34,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 21:34:34,008 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 21:34:34,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 21:34:34,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 21:34:34,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 21:34:34,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 21:34:34,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:34:34,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 21:34:34,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 21:34:34,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 21:34:34,025 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 21:34:34,025 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 21:34:34,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 21:34:34,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 21:34:34,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 21:34:34,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 21:34:34,026 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 21:34:34,027 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b91dae833bbe914f6db858614925f2e5ed6a0d4828d26d06ca221fba91b27025 [2024-10-24 21:34:34,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 21:34:34,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 21:34:34,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 21:34:34,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 21:34:34,357 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 21:34:34,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2024-10-24 21:34:35,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 21:34:36,290 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 21:34:36,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2024-10-24 21:34:36,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63df73541/bce0511ddbd14cf48fffc7bf035564d2/FLAG6a2198a75 [2024-10-24 21:34:36,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63df73541/bce0511ddbd14cf48fffc7bf035564d2 [2024-10-24 21:34:36,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 21:34:36,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 21:34:36,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 21:34:36,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 21:34:36,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 21:34:36,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:34:36" (1/1) ... [2024-10-24 21:34:36,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7280537d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:36, skipping insertion in model container [2024-10-24 21:34:36,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:34:36" (1/1) ... [2024-10-24 21:34:36,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 21:34:37,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:34:37,311 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 21:34:37,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:34:37,623 INFO L204 MainTranslator]: Completed translation [2024-10-24 21:34:37,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:37 WrapperNode [2024-10-24 21:34:37,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 21:34:37,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 21:34:37,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 21:34:37,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 21:34:37,632 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:34:37" (1/1) ... [2024-10-24 21:34:37,671 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:34:37" (1/1) ... [2024-10-24 21:34:37,705 INFO L138 Inliner]: procedures = 503, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2024-10-24 21:34:37,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 21:34:37,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 21:34:37,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 21:34:37,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 21:34:37,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:37" (1/1) ... [2024-10-24 21:34:37,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:37" (1/1) ... [2024-10-24 21:34:37,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:37" (1/1) ... [2024-10-24 21:34:37,748 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:34:37,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:37" (1/1) ... [2024-10-24 21:34:37,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:37" (1/1) ... [2024-10-24 21:34:37,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:37" (1/1) ... [2024-10-24 21:34:37,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:37" (1/1) ... [2024-10-24 21:34:37,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:37" (1/1) ... [2024-10-24 21:34:37,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:37" (1/1) ... [2024-10-24 21:34:37,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 21:34:37,782 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 21:34:37,782 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 21:34:37,782 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 21:34:37,783 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:37" (1/1) ... [2024-10-24 21:34:37,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:34:37,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 21:34:37,823 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:34:37,825 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:34:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-24 21:34:37,866 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-24 21:34:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-10-24 21:34:37,866 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-10-24 21:34:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 21:34:37,866 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 21:34:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 21:34:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 21:34:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 21:34:37,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 21:34:38,058 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 21:34:38,060 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 21:34:38,223 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 21:34:38,227 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 21:34:38,267 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 21:34:38,270 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 21:34:38,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:34:38 BoogieIcfgContainer [2024-10-24 21:34:38,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 21:34:38,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 21:34:38,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 21:34:38,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 21:34:38,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:34:36" (1/3) ... [2024-10-24 21:34:38,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4915c63a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:34:38, skipping insertion in model container [2024-10-24 21:34:38,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:34:37" (2/3) ... [2024-10-24 21:34:38,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4915c63a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:34:38, skipping insertion in model container [2024-10-24 21:34:38,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:34:38" (3/3) ... [2024-10-24 21:34:38,280 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2024-10-24 21:34:38,296 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 21:34:38,297 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-24 21:34:38,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 21:34:38,374 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;@34b318c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 21:34:38,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-24 21:34:38,379 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:34:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 21:34:38,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:34:38,387 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:34:38,387 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:34:38,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:34:38,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1066203022, now seen corresponding path program 1 times [2024-10-24 21:34:38,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:34:38,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607934390] [2024-10-24 21:34:38,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:34:38,410 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:34:38,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:34:38,413 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:34:38,415 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:34:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:34:38,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 21:34:38,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 21:34:38,555 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:34:38,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 21:34:38,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 21:34:38,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607934390] [2024-10-24 21:34:38,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607934390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:34:38,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:34:38,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 21:34:38,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46495460] [2024-10-24 21:34:38,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:34:38,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 21:34:38,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 21:34:38,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 21:34:38,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 21:34:38,591 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:34:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:34:38,621 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-10-24 21:34:38,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 21:34:38,626 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:34:38,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:34:38,633 INFO L225 Difference]: With dead ends: 38 [2024-10-24 21:34:38,633 INFO L226 Difference]: Without dead ends: 24 [2024-10-24 21:34:38,636 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:34:38,640 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:34:38,642 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:34:38,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-24 21:34:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-24 21:34:38,675 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:34:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-24 21:34:38,679 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2024-10-24 21:34:38,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:34:38,681 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-24 21:34:38,681 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:34:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-24 21:34:38,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 21:34:38,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:34:38,683 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:34:38,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 21:34:38,887 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:34:38,887 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:34:38,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:34:38,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1307444756, now seen corresponding path program 1 times [2024-10-24 21:34:38,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:34:38,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953033154] [2024-10-24 21:34:38,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:34:38,889 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:34:38,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:34:38,893 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:34:38,894 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:34:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:34:38,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 21:34:38,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 21:34:39,032 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:34:39,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 21:34:39,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 21:34:39,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953033154] [2024-10-24 21:34:39,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953033154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:34:39,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:34:39,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 21:34:39,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570640290] [2024-10-24 21:34:39,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:34:39,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 21:34:39,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 21:34:39,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 21:34:39,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:34:39,039 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:34:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:34:39,074 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-10-24 21:34:39,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 21:34:39,074 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:34:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:34:39,075 INFO L225 Difference]: With dead ends: 33 [2024-10-24 21:34:39,075 INFO L226 Difference]: Without dead ends: 24 [2024-10-24 21:34:39,076 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:34:39,078 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:34:39,078 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:34:39,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-24 21:34:39,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-24 21:34:39,085 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:34:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-10-24 21:34:39,087 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2024-10-24 21:34:39,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:34:39,087 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-24 21:34:39,087 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:34:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-10-24 21:34:39,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 21:34:39,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:34:39,089 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:34:39,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 21:34:39,289 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:34:39,290 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:34:39,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:34:39,291 INFO L85 PathProgramCache]: Analyzing trace with hash -211005393, now seen corresponding path program 1 times [2024-10-24 21:34:39,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:34:39,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346340648] [2024-10-24 21:34:39,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:34:39,292 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:34:39,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:34:39,295 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:34:39,298 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:34:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:34:39,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 21:34:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:34:39,426 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 21:34:39,427 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 21:34:39,428 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-24 21:34:39,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-24 21:34:39,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-24 21:34:39,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-24 21:34:39,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 21:34:39,633 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:34:39,636 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 21:34:39,668 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 21:34:39,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:34:39 BoogieIcfgContainer [2024-10-24 21:34:39,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 21:34:39,673 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 21:34:39,673 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 21:34:39,674 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 21:34:39,674 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:34:38" (3/4) ... [2024-10-24 21:34:39,676 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 21:34:39,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 21:34:39,678 INFO L158 Benchmark]: Toolchain (without parser) took 3162.79ms. Allocated memory was 62.9MB in the beginning and 104.9MB in the end (delta: 41.9MB). Free memory was 41.1MB in the beginning and 57.5MB in the end (delta: -16.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-10-24 21:34:39,679 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory was 37.6MB in the beginning and 37.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:34:39,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1107.88ms. Allocated memory was 62.9MB in the beginning and 104.9MB in the end (delta: 41.9MB). Free memory was 40.9MB in the beginning and 58.9MB in the end (delta: -18.0MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2024-10-24 21:34:39,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.82ms. Allocated memory is still 104.9MB. Free memory was 58.9MB in the beginning and 55.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 21:34:39,680 INFO L158 Benchmark]: Boogie Preprocessor took 74.65ms. Allocated memory is still 104.9MB. Free memory was 55.8MB in the beginning and 53.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:34:39,681 INFO L158 Benchmark]: RCFGBuilder took 489.18ms. Allocated memory is still 104.9MB. Free memory was 52.6MB in the beginning and 65.5MB in the end (delta: -12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 21:34:39,681 INFO L158 Benchmark]: TraceAbstraction took 1400.13ms. Allocated memory is still 104.9MB. Free memory was 64.9MB in the beginning and 57.5MB in the end (delta: 7.4MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-10-24 21:34:39,681 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 104.9MB. Free memory is still 57.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:34:39,684 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory was 37.6MB in the beginning and 37.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1107.88ms. Allocated memory was 62.9MB in the beginning and 104.9MB in the end (delta: 41.9MB). Free memory was 40.9MB in the beginning and 58.9MB in the end (delta: -18.0MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.82ms. Allocated memory is still 104.9MB. Free memory was 58.9MB in the beginning and 55.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.65ms. Allocated memory is still 104.9MB. Free memory was 55.8MB in the beginning and 53.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 489.18ms. Allocated memory is still 104.9MB. Free memory was 52.6MB in the beginning and 65.5MB in the end (delta: -12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1400.13ms. Allocated memory is still 104.9MB. Free memory was 64.9MB in the beginning and 57.5MB in the end (delta: 7.4MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 104.9MB. Free memory is still 57.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1595, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1595] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1595] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1596] CALL CWE190_Integer_Overflow__int_fgets_preinc_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 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:34:39,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample