./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_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 9669eaa504993e58400e39aa486d7137654633921a41df1436ba4312e9969738 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 14:12:07,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 14:12:07,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 14:12:07,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 14:12:07,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 14:12:07,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 14:12:07,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 14:12:07,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 14:12:07,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 14:12:07,489 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 14:12:07,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 14:12:07,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 14:12:07,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 14:12:07,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 14:12:07,491 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 14:12:07,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 14:12:07,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 14:12:07,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 14:12:07,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 14:12:07,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 14:12:07,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 14:12:07,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 14:12:07,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 14:12:07,495 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 14:12:07,495 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 14:12:07,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 14:12:07,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 14:12:07,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 14:12:07,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 14:12:07,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 14:12:07,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 14:12:07,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:12:07,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 14:12:07,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 14:12:07,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 14:12:07,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 14:12:07,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 14:12:07,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 14:12:07,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 14:12:07,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 14:12:07,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 14:12:07,500 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 -> 9669eaa504993e58400e39aa486d7137654633921a41df1436ba4312e9969738 [2024-11-09 14:12:07,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:12:07,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:12:07,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:12:07,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:12:07,766 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:12:07,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_12_bad.i [2024-11-09 14:12:09,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:12:09,518 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:12:09,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_12_bad.i [2024-11-09 14:12:09,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ab859e04/2be57bdf1e0d4992b4f912e0758b4b4a/FLAG67d107331 [2024-11-09 14:12:09,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ab859e04/2be57bdf1e0d4992b4f912e0758b4b4a [2024-11-09 14:12:09,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:12:09,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:12:09,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:12:09,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:12:09,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:12:09,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:12:09" (1/1) ... [2024-11-09 14:12:09,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cbb0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:09, skipping insertion in model container [2024-11-09 14:12:09,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:12:09" (1/1) ... [2024-11-09 14:12:09,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:12:10,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:12:10,429 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:12:10,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:12:10,634 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:12:10,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:10 WrapperNode [2024-11-09 14:12:10,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:12:10,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:12:10,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:12:10,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:12:10,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:10" (1/1) ... [2024-11-09 14:12:10,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:10" (1/1) ... [2024-11-09 14:12:10,707 INFO L138 Inliner]: procedures = 498, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-11-09 14:12:10,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:12:10,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:12:10,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:12:10,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:12:10,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:10" (1/1) ... [2024-11-09 14:12:10,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:10" (1/1) ... [2024-11-09 14:12:10,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:10" (1/1) ... [2024-11-09 14:12:10,750 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-09 14:12:10,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:10" (1/1) ... [2024-11-09 14:12:10,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:10" (1/1) ... [2024-11-09 14:12:10,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:10" (1/1) ... [2024-11-09 14:12:10,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:10" (1/1) ... [2024-11-09 14:12:10,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:10" (1/1) ... [2024-11-09 14:12:10,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:10" (1/1) ... [2024-11-09 14:12:10,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:12:10,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:12:10,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:12:10,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:12:10,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:10" (1/1) ... [2024-11-09 14:12:10,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:12:10,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:12:10,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 14:12:10,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 14:12:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-09 14:12:10,871 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-09 14:12:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-09 14:12:10,871 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-09 14:12:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 14:12:10,872 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 14:12:10,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:12:10,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:12:10,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:12:10,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 14:12:11,031 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:12:11,033 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:12:11,212 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-09 14:12:11,213 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:12:11,231 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:12:11,235 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 14:12:11,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:12:11 BoogieIcfgContainer [2024-11-09 14:12:11,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:12:11,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:12:11,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:12:11,243 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:12:11,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:12:09" (1/3) ... [2024-11-09 14:12:11,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3b37e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:12:11, skipping insertion in model container [2024-11-09 14:12:11,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:10" (2/3) ... [2024-11-09 14:12:11,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3b37e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:12:11, skipping insertion in model container [2024-11-09 14:12:11,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:12:11" (3/3) ... [2024-11-09 14:12:11,247 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_sub_12_bad.i [2024-11-09 14:12:11,262 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:12:11,262 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 14:12:11,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:12:11,321 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;@512afd45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:12:11,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 14:12:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 14:12:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 14:12:11,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:12:11,336 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:12:11,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 14:12:11,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:12:11,344 INFO L85 PathProgramCache]: Analyzing trace with hash -786218938, now seen corresponding path program 1 times [2024-11-09 14:12:11,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:12:11,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659274644] [2024-11-09 14:12:11,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:12:11,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:12:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:12:11,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 14:12:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:12:11,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 14:12:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:12:11,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 14:12:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:12:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 14:12:11,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:12:11,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659274644] [2024-11-09 14:12:11,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659274644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:12:11,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:12:11,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:12:11,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977518475] [2024-11-09 14:12:11,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:12:11,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:12:11,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:12:11,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:12:11,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:12:11,793 INFO L87 Difference]: Start difference. First operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:12:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:12:11,862 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2024-11-09 14:12:11,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:12:11,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-09 14:12:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:12:11,872 INFO L225 Difference]: With dead ends: 68 [2024-11-09 14:12:11,873 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 14:12:11,876 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-11-09 14:12:11,880 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:12:11,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 93 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:12:11,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 14:12:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-09 14:12:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 29 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 14:12:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-09 14:12:11,916 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 21 [2024-11-09 14:12:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:12:11,918 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-09 14:12:11,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:12:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-11-09 14:12:11,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 14:12:11,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:12:11,921 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:12:11,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 14:12:11,922 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 14:12:11,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:12:11,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1397016770, now seen corresponding path program 1 times [2024-11-09 14:12:11,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:12:11,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600346367] [2024-11-09 14:12:11,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:12:11,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:12:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:12:12,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 14:12:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:12:12,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 14:12:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:12:12,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 14:12:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:12:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 14:12:12,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:12:12,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600346367] [2024-11-09 14:12:12,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600346367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:12:12,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:12:12,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:12:12,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337587213] [2024-11-09 14:12:12,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:12:12,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:12:12,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:12:12,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:12:12,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:12:12,090 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:12:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:12:12,121 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-09 14:12:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:12:12,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-09 14:12:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:12:12,123 INFO L225 Difference]: With dead ends: 47 [2024-11-09 14:12:12,123 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 14:12:12,123 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-11-09 14:12:12,125 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:12:12,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 62 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:12:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 14:12:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 14:12:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 14:12:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-09 14:12:12,133 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 22 [2024-11-09 14:12:12,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:12:12,133 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-09 14:12:12,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:12:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-09 14:12:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 14:12:12,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:12:12,134 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:12:12,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 14:12:12,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 14:12:12,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:12:12,135 INFO L85 PathProgramCache]: Analyzing trace with hash -369234517, now seen corresponding path program 1 times [2024-11-09 14:12:12,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:12:12,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531761587] [2024-11-09 14:12:12,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:12:12,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:12:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:12:12,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 14:12:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:12:12,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 14:12:12,233 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 14:12:12,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 14:12:12,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 14:12:12,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 14:12:12,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 14:12:12,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 14:12:12,240 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 14:12:12,262 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 14:12:12,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:12:12 BoogieIcfgContainer [2024-11-09 14:12:12,265 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 14:12:12,265 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 14:12:12,266 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 14:12:12,266 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 14:12:12,266 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:12:11" (3/4) ... [2024-11-09 14:12:12,269 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 14:12:12,270 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 14:12:12,270 INFO L158 Benchmark]: Toolchain (without parser) took 2699.52ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 96.4MB in the beginning and 99.3MB in the end (delta: -2.9MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2024-11-09 14:12:12,271 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:12:12,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1061.79ms. Allocated memory is still 157.3MB. Free memory was 96.4MB in the beginning and 71.3MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 14:12:12,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.57ms. Allocated memory is still 157.3MB. Free memory was 71.3MB in the beginning and 68.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 14:12:12,273 INFO L158 Benchmark]: Boogie Preprocessor took 66.77ms. Allocated memory is still 157.3MB. Free memory was 68.5MB in the beginning and 65.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 14:12:12,274 INFO L158 Benchmark]: RCFGBuilder took 459.13ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 65.9MB in the beginning and 159.0MB in the end (delta: -93.1MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-11-09 14:12:12,274 INFO L158 Benchmark]: TraceAbstraction took 1026.68ms. Allocated memory is still 199.2MB. Free memory was 158.0MB in the beginning and 99.3MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-09 14:12:12,274 INFO L158 Benchmark]: Witness Printer took 4.45ms. Allocated memory is still 199.2MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:12:12,277 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1061.79ms. Allocated memory is still 157.3MB. Free memory was 96.4MB in the beginning and 71.3MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.57ms. Allocated memory is still 157.3MB. Free memory was 71.3MB in the beginning and 68.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.77ms. Allocated memory is still 157.3MB. Free memory was 68.5MB in the beginning and 65.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 459.13ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 65.9MB in the beginning and 159.0MB in the end (delta: -93.1MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1026.68ms. Allocated memory is still 199.2MB. Free memory was 158.0MB in the beginning and 99.3MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Witness Printer took 4.45ms. Allocated memory is still 199.2MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1593, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1593] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1593] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1594] CALL CWE191_Integer_Underflow__int_fgets_sub_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=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] data - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.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, 155 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 97 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 77 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 14:12:12,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_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 9669eaa504993e58400e39aa486d7137654633921a41df1436ba4312e9969738 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 14:12:14,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 14:12:14,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-09 14:12:14,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 14:12:14,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 14:12:14,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-09 14:12:14,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 14:12:14,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 14:12:14,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 14:12:14,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 14:12:14,629 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 14:12:14,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 14:12:14,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 14:12:14,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 14:12:14,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 14:12:14,631 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 14:12:14,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 14:12:14,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 14:12:14,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 14:12:14,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 14:12:14,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 14:12:14,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 14:12:14,639 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 14:12:14,640 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 14:12:14,640 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 14:12:14,640 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 14:12:14,640 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 14:12:14,640 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 14:12:14,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 14:12:14,641 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 14:12:14,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 14:12:14,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 14:12:14,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 14:12:14,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 14:12:14,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:12:14,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 14:12:14,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 14:12:14,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 14:12:14,645 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 14:12:14,645 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 14:12:14,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 14:12:14,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 14:12:14,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 14:12:14,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 14:12:14,647 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 -> 9669eaa504993e58400e39aa486d7137654633921a41df1436ba4312e9969738 [2024-11-09 14:12:14,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:12:14,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:12:14,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:12:14,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:12:14,997 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:12:14,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_12_bad.i [2024-11-09 14:12:16,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:12:16,781 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:12:16,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_12_bad.i [2024-11-09 14:12:16,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241bd4b15/ae74b8d19292435abf61d80baf8c066b/FLAGbc4356d31 [2024-11-09 14:12:16,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241bd4b15/ae74b8d19292435abf61d80baf8c066b [2024-11-09 14:12:16,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:12:16,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:12:16,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:12:16,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:12:16,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:12:16,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:12:16" (1/1) ... [2024-11-09 14:12:16,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d883c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:16, skipping insertion in model container [2024-11-09 14:12:16,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:12:16" (1/1) ... [2024-11-09 14:12:16,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:12:17,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:12:17,619 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:12:17,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:12:17,871 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:12:17,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:17 WrapperNode [2024-11-09 14:12:17,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:12:17,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:12:17,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:12:17,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:12:17,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:17" (1/1) ... [2024-11-09 14:12:17,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:17" (1/1) ... [2024-11-09 14:12:17,945 INFO L138 Inliner]: procedures = 503, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2024-11-09 14:12:17,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:12:17,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:12:17,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:12:17,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:12:17,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:17" (1/1) ... [2024-11-09 14:12:17,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:17" (1/1) ... [2024-11-09 14:12:17,961 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:17" (1/1) ... [2024-11-09 14:12:17,987 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-09 14:12:17,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:17" (1/1) ... [2024-11-09 14:12:17,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:17" (1/1) ... [2024-11-09 14:12:18,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:17" (1/1) ... [2024-11-09 14:12:18,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:17" (1/1) ... [2024-11-09 14:12:18,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:17" (1/1) ... [2024-11-09 14:12:18,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:17" (1/1) ... [2024-11-09 14:12:18,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:12:18,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:12:18,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:12:18,022 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:12:18,023 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:17" (1/1) ... [2024-11-09 14:12:18,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:12:18,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:12:18,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 14:12:18,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 14:12:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-09 14:12:18,112 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-09 14:12:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-09 14:12:18,112 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-09 14:12:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 14:12:18,112 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 14:12:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 14:12:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:12:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:12:18,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:12:18,270 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:12:18,272 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:12:18,460 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-09 14:12:18,462 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:12:18,476 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:12:18,476 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 14:12:18,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:12:18 BoogieIcfgContainer [2024-11-09 14:12:18,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:12:18,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:12:18,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:12:18,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:12:18,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:12:16" (1/3) ... [2024-11-09 14:12:18,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a462b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:12:18, skipping insertion in model container [2024-11-09 14:12:18,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:17" (2/3) ... [2024-11-09 14:12:18,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a462b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:12:18, skipping insertion in model container [2024-11-09 14:12:18,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:12:18" (3/3) ... [2024-11-09 14:12:18,487 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_sub_12_bad.i [2024-11-09 14:12:18,503 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:12:18,503 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 14:12:18,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:12:18,586 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;@7550b67c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:12:18,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 14:12:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 14:12:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 14:12:18,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:12:18,601 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:12:18,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 14:12:18,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:12:18,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1142699916, now seen corresponding path program 1 times [2024-11-09 14:12:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:12:18,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568381201] [2024-11-09 14:12:18,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:12:18,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 14:12:18,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:12:18,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 14:12:18,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 14:12:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:12:18,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 14:12:18,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:12:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 14:12:18,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:12:18,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:12:18,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568381201] [2024-11-09 14:12:18,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568381201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:12:18,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:12:18,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:12:18,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6986408] [2024-11-09 14:12:18,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:12:18,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:12:18,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:12:18,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:12:18,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:12:18,864 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 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-11-09 14:12:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:12:18,924 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2024-11-09 14:12:18,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:12:18,927 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 19 [2024-11-09 14:12:18,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:12:18,933 INFO L225 Difference]: With dead ends: 64 [2024-11-09 14:12:18,934 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 14:12:18,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:12:18,941 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:12:18,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 91 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:12:18,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 14:12:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 14:12:18,972 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-11-09 14:12:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-09 14:12:18,974 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 19 [2024-11-09 14:12:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:12:18,978 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-09 14:12:18,978 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-11-09 14:12:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-09 14:12:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 14:12:18,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:12:18,979 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:12:18,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 14:12:19,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 14:12:19,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 14:12:19,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:12:19,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1847522777, now seen corresponding path program 1 times [2024-11-09 14:12:19,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:12:19,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200624451] [2024-11-09 14:12:19,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:12:19,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 14:12:19,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:12:19,190 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 14:12:19,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 14:12:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:12:19,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 14:12:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:12:19,433 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 14:12:19,434 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 14:12:19,435 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 14:12:19,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 14:12:19,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 14:12:19,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 14:12:19,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 14:12:19,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 14:12:19,672 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 14:12:19,699 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 14:12:19,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:12:19 BoogieIcfgContainer [2024-11-09 14:12:19,703 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 14:12:19,704 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 14:12:19,704 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 14:12:19,704 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 14:12:19,705 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:12:18" (3/4) ... [2024-11-09 14:12:19,707 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 14:12:19,708 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 14:12:19,709 INFO L158 Benchmark]: Toolchain (without parser) took 2877.41ms. Allocated memory was 60.8MB in the beginning and 98.6MB in the end (delta: 37.7MB). Free memory was 30.7MB in the beginning and 66.2MB in the end (delta: -35.6MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-11-09 14:12:19,710 INFO L158 Benchmark]: CDTParser took 1.63ms. Allocated memory is still 44.0MB. Free memory is still 20.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:12:19,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1038.80ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 30.4MB in the beginning and 34.9MB in the end (delta: -4.5MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-11-09 14:12:19,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.61ms. Allocated memory is still 77.6MB. Free memory was 34.9MB in the beginning and 31.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 14:12:19,712 INFO L158 Benchmark]: Boogie Preprocessor took 75.49ms. Allocated memory is still 77.6MB. Free memory was 31.5MB in the beginning and 28.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 14:12:19,712 INFO L158 Benchmark]: RCFGBuilder took 455.28ms. Allocated memory is still 77.6MB. Free memory was 28.7MB in the beginning and 36.5MB in the end (delta: -7.9MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-11-09 14:12:19,712 INFO L158 Benchmark]: TraceAbstraction took 1223.95ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 36.1MB in the beginning and 66.9MB in the end (delta: -30.8MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-11-09 14:12:19,713 INFO L158 Benchmark]: Witness Printer took 4.64ms. Allocated memory is still 98.6MB. Free memory was 66.9MB in the beginning and 66.2MB in the end (delta: 666.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:12:19,719 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.63ms. Allocated memory is still 44.0MB. Free memory is still 20.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1038.80ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 30.4MB in the beginning and 34.9MB in the end (delta: -4.5MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.61ms. Allocated memory is still 77.6MB. Free memory was 34.9MB in the beginning and 31.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.49ms. Allocated memory is still 77.6MB. Free memory was 31.5MB in the beginning and 28.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 455.28ms. Allocated memory is still 77.6MB. Free memory was 28.7MB in the beginning and 36.5MB in the end (delta: -7.9MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1223.95ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 36.1MB in the beginning and 66.9MB in the end (delta: -30.8MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Witness Printer took 4.64ms. Allocated memory is still 98.6MB. Free memory was 66.9MB in the beginning and 66.2MB in the end (delta: 666.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1593, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1593] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1593] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1594] CALL CWE191_Integer_Underflow__int_fgets_sub_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=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] data - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 53 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 3, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 30 SizeOfPredicates, 0 NumberOfNonLiveVariables, 61 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 14:12:19,755 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