./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_16_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_16_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 d03d41497e0f5058a2c8524383adbc0c8d28214654016469a458919e0265b126 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 05:46:55,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 05:46:55,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-17 05:46:55,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 05:46:55,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 05:46:55,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 05:46:55,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 05:46:55,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 05:46:55,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 05:46:55,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 05:46:55,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 05:46:55,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 05:46:55,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 05:46:55,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 05:46:55,100 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 05:46:55,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 05:46:55,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 05:46:55,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 05:46:55,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 05:46:55,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 05:46:55,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 05:46:55,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 05:46:55,107 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 05:46:55,107 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 05:46:55,107 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 05:46:55,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 05:46:55,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 05:46:55,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 05:46:55,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 05:46:55,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 05:46:55,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 05:46:55,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:46:55,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 05:46:55,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 05:46:55,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 05:46:55,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 05:46:55,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 05:46:55,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 05:46:55,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 05:46:55,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 05:46:55,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 05:46:55,110 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 -> d03d41497e0f5058a2c8524383adbc0c8d28214654016469a458919e0265b126 [2024-11-17 05:46:55,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 05:46:55,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 05:46:55,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 05:46:55,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 05:46:55,301 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 05:46:55,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_16_bad.i [2024-11-17 05:46:56,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 05:46:56,761 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 05:46:56,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_16_bad.i [2024-11-17 05:46:56,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e75011ea/22fcd28f810345d1a5b792c60e12e4fd/FLAG5a09c9057 [2024-11-17 05:46:56,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e75011ea/22fcd28f810345d1a5b792c60e12e4fd [2024-11-17 05:46:56,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 05:46:56,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 05:46:56,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 05:46:56,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 05:46:56,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 05:46:56,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:46:56" (1/1) ... [2024-11-17 05:46:56,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5de27835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:56, skipping insertion in model container [2024-11-17 05:46:56,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:46:56" (1/1) ... [2024-11-17 05:46:56,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 05:46:57,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:46:57,437 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 05:46:57,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:46:57,619 INFO L204 MainTranslator]: Completed translation [2024-11-17 05:46:57,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:57 WrapperNode [2024-11-17 05:46:57,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 05:46:57,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 05:46:57,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 05:46:57,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 05:46:57,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:57" (1/1) ... [2024-11-17 05:46:57,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:57" (1/1) ... [2024-11-17 05:46:57,663 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-11-17 05:46:57,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 05:46:57,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 05:46:57,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 05:46:57,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 05:46:57,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:57" (1/1) ... [2024-11-17 05:46:57,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:57" (1/1) ... [2024-11-17 05:46:57,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:57" (1/1) ... [2024-11-17 05:46:57,685 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-17 05:46:57,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:57" (1/1) ... [2024-11-17 05:46:57,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:57" (1/1) ... [2024-11-17 05:46:57,692 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:57" (1/1) ... [2024-11-17 05:46:57,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:57" (1/1) ... [2024-11-17 05:46:57,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:57" (1/1) ... [2024-11-17 05:46:57,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:57" (1/1) ... [2024-11-17 05:46:57,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 05:46:57,698 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 05:46:57,698 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 05:46:57,698 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 05:46:57,699 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:57" (1/1) ... [2024-11-17 05:46:57,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:46:57,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:46:57,734 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-17 05:46:57,737 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-17 05:46:57,778 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 05:46:57,778 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 05:46:57,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 05:46:57,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 05:46:57,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 05:46:57,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 05:46:57,911 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 05:46:57,912 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 05:46:58,014 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-17 05:46:58,014 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 05:46:58,028 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 05:46:58,028 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 05:46:58,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:46:58 BoogieIcfgContainer [2024-11-17 05:46:58,029 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 05:46:58,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 05:46:58,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 05:46:58,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 05:46:58,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 05:46:56" (1/3) ... [2024-11-17 05:46:58,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28328127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:46:58, skipping insertion in model container [2024-11-17 05:46:58,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:46:57" (2/3) ... [2024-11-17 05:46:58,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28328127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:46:58, skipping insertion in model container [2024-11-17 05:46:58,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:46:58" (3/3) ... [2024-11-17 05:46:58,035 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_16_bad.i [2024-11-17 05:46:58,048 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 05:46:58,049 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 05:46:58,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 05:46:58,102 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;@2b97c7f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 05:46:58,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 05:46:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 05:46:58,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 05:46:58,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:46:58,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:46:58,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:46:58,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:46:58,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1649752907, now seen corresponding path program 1 times [2024-11-17 05:46:58,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:46:58,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308345158] [2024-11-17 05:46:58,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:46:58,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:46:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:46:58,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 05:46:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:46:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:46:58,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:46:58,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308345158] [2024-11-17 05:46:58,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308345158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:46:58,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 05:46:58,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 05:46:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851891197] [2024-11-17 05:46:58,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:46:58,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 05:46:58,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:46:58,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 05:46:58,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 05:46:58,345 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:46:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:46:58,356 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2024-11-17 05:46:58,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 05:46:58,358 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-17 05:46:58,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:46:58,362 INFO L225 Difference]: With dead ends: 48 [2024-11-17 05:46:58,362 INFO L226 Difference]: Without dead ends: 21 [2024-11-17 05:46:58,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 05:46:58,366 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:46:58,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:46:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-17 05:46:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-17 05:46:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 05:46:58,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-17 05:46:58,389 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2024-11-17 05:46:58,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:46:58,390 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-17 05:46:58,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:46:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-11-17 05:46:58,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 05:46:58,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:46:58,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:46:58,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 05:46:58,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:46:58,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:46:58,392 INFO L85 PathProgramCache]: Analyzing trace with hash -859399346, now seen corresponding path program 1 times [2024-11-17 05:46:58,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:46:58,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860954037] [2024-11-17 05:46:58,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:46:58,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:46:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:46:58,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 05:46:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:46:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:46:58,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:46:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860954037] [2024-11-17 05:46:58,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860954037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:46:58,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 05:46:58,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 05:46:58,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188951807] [2024-11-17 05:46:58,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:46:58,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 05:46:58,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:46:58,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 05:46:58,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 05:46:58,494 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:46:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:46:58,506 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-17 05:46:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 05:46:58,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-17 05:46:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:46:58,507 INFO L225 Difference]: With dead ends: 21 [2024-11-17 05:46:58,507 INFO L226 Difference]: Without dead ends: 20 [2024-11-17 05:46:58,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-17 05:46:58,508 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:46:58,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:46:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-17 05:46:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-17 05:46:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 05:46:58,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-17 05:46:58,513 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2024-11-17 05:46:58,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:46:58,513 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-17 05:46:58,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:46:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-17 05:46:58,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 05:46:58,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:46:58,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:46:58,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 05:46:58,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:46:58,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:46:58,516 INFO L85 PathProgramCache]: Analyzing trace with hash -871575969, now seen corresponding path program 1 times [2024-11-17 05:46:58,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:46:58,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589450722] [2024-11-17 05:46:58,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:46:58,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:46:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 05:46:58,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 05:46:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 05:46:58,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 05:46:58,566 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 05:46:58,567 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-17 05:46:58,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-17 05:46:58,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 05:46:58,571 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-17 05:46:58,603 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 05:46:58,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 05:46:58 BoogieIcfgContainer [2024-11-17 05:46:58,607 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 05:46:58,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 05:46:58,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 05:46:58,608 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 05:46:58,608 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:46:58" (3/4) ... [2024-11-17 05:46:58,610 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 05:46:58,611 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 05:46:58,612 INFO L158 Benchmark]: Toolchain (without parser) took 1804.46ms. Allocated memory was 153.1MB in the beginning and 211.8MB in the end (delta: 58.7MB). Free memory was 93.2MB in the beginning and 77.8MB in the end (delta: 15.3MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2024-11-17 05:46:58,612 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 153.1MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:46:58,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 811.75ms. Allocated memory was 153.1MB in the beginning and 211.8MB in the end (delta: 58.7MB). Free memory was 92.8MB in the beginning and 140.7MB in the end (delta: -47.9MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2024-11-17 05:46:58,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.76ms. Allocated memory is still 211.8MB. Free memory was 140.7MB in the beginning and 138.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 05:46:58,613 INFO L158 Benchmark]: Boogie Preprocessor took 33.65ms. Allocated memory is still 211.8MB. Free memory was 138.6MB in the beginning and 136.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 05:46:58,613 INFO L158 Benchmark]: IcfgBuilder took 330.94ms. Allocated memory is still 211.8MB. Free memory was 136.5MB in the beginning and 121.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 05:46:58,614 INFO L158 Benchmark]: TraceAbstraction took 576.85ms. Allocated memory is still 211.8MB. Free memory was 121.9MB in the beginning and 77.8MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-17 05:46:58,614 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 211.8MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:46:58,616 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 153.1MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 811.75ms. Allocated memory was 153.1MB in the beginning and 211.8MB in the end (delta: 58.7MB). Free memory was 92.8MB in the beginning and 140.7MB in the end (delta: -47.9MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.76ms. Allocated memory is still 211.8MB. Free memory was 140.7MB in the beginning and 138.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.65ms. Allocated memory is still 211.8MB. Free memory was 138.6MB in the beginning and 136.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 330.94ms. Allocated memory is still 211.8MB. Free memory was 136.5MB in the beginning and 121.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 576.85ms. Allocated memory is still 211.8MB. Free memory was 121.9MB in the beginning and 77.8MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 211.8MB. Free memory is still 77.8MB. 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: 1571]: 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 1580, 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] [L1580] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1580] 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] [L1581] CALL CWE190_Integer_Overflow__int_fgets_multiply_16_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] COND TRUE 1 [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) [L1567] COND TRUE 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1571] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1571]: 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 2 procedures, 29 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 29 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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-17 05:46:58,638 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/CWE190_Integer_Overflow__int_fgets_multiply_16_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 d03d41497e0f5058a2c8524383adbc0c8d28214654016469a458919e0265b126 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 05:47:00,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 05:47:00,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-17 05:47:00,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 05:47:00,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 05:47:00,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-17 05:47:00,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 05:47:00,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 05:47:00,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 05:47:00,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 05:47:00,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 05:47:00,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 05:47:00,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 05:47:00,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 05:47:00,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 05:47:00,568 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 05:47:00,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 05:47:00,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 05:47:00,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 05:47:00,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 05:47:00,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 05:47:00,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 05:47:00,570 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 05:47:00,570 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 05:47:00,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 05:47:00,571 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 05:47:00,571 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 05:47:00,571 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 05:47:00,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 05:47:00,580 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 05:47:00,581 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 05:47:00,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 05:47:00,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 05:47:00,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 05:47:00,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:47:00,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 05:47:00,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 05:47:00,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 05:47:00,584 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 05:47:00,584 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 05:47:00,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 05:47:00,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 05:47:00,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 05:47:00,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 05:47:00,586 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 -> d03d41497e0f5058a2c8524383adbc0c8d28214654016469a458919e0265b126 [2024-11-17 05:47:00,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 05:47:00,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 05:47:00,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 05:47:00,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 05:47:00,833 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 05:47:00,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_16_bad.i [2024-11-17 05:47:02,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 05:47:02,310 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 05:47:02,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_16_bad.i [2024-11-17 05:47:02,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe8125da/9df11ee9b1b74036a65ec32af5f343c9/FLAG341f05965 [2024-11-17 05:47:02,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe8125da/9df11ee9b1b74036a65ec32af5f343c9 [2024-11-17 05:47:02,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 05:47:02,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 05:47:02,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 05:47:02,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 05:47:02,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 05:47:02,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:47:02" (1/1) ... [2024-11-17 05:47:02,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad3f08b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:02, skipping insertion in model container [2024-11-17 05:47:02,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:47:02" (1/1) ... [2024-11-17 05:47:02,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 05:47:03,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:47:03,299 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 05:47:03,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:47:03,455 INFO L204 MainTranslator]: Completed translation [2024-11-17 05:47:03,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:03 WrapperNode [2024-11-17 05:47:03,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 05:47:03,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 05:47:03,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 05:47:03,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 05:47:03,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:03" (1/1) ... [2024-11-17 05:47:03,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:03" (1/1) ... [2024-11-17 05:47:03,500 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2024-11-17 05:47:03,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 05:47:03,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 05:47:03,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 05:47:03,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 05:47:03,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:03" (1/1) ... [2024-11-17 05:47:03,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:03" (1/1) ... [2024-11-17 05:47:03,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:03" (1/1) ... [2024-11-17 05:47:03,524 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-17 05:47:03,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:03" (1/1) ... [2024-11-17 05:47:03,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:03" (1/1) ... [2024-11-17 05:47:03,530 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:03" (1/1) ... [2024-11-17 05:47:03,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:03" (1/1) ... [2024-11-17 05:47:03,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:03" (1/1) ... [2024-11-17 05:47:03,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:03" (1/1) ... [2024-11-17 05:47:03,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 05:47:03,536 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 05:47:03,536 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 05:47:03,536 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 05:47:03,537 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:03" (1/1) ... [2024-11-17 05:47:03,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:47:03,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:47:03,569 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-17 05:47:03,572 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-17 05:47:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 05:47:03,606 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 05:47:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 05:47:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 05:47:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 05:47:03,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 05:47:03,749 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 05:47:03,751 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 05:47:03,853 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-17 05:47:03,853 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 05:47:03,865 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 05:47:03,866 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 05:47:03,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:47:03 BoogieIcfgContainer [2024-11-17 05:47:03,867 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 05:47:03,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 05:47:03,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 05:47:03,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 05:47:03,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 05:47:02" (1/3) ... [2024-11-17 05:47:03,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f1373c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:47:03, skipping insertion in model container [2024-11-17 05:47:03,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:47:03" (2/3) ... [2024-11-17 05:47:03,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f1373c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:47:03, skipping insertion in model container [2024-11-17 05:47:03,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:47:03" (3/3) ... [2024-11-17 05:47:03,874 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_16_bad.i [2024-11-17 05:47:03,886 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 05:47:03,886 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 05:47:03,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 05:47:03,945 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;@496645fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 05:47:03,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 05:47:03,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 05:47:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 05:47:03,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:47:03,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:47:03,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:47:03,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:47:03,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1649752907, now seen corresponding path program 1 times [2024-11-17 05:47:03,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 05:47:03,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341156467] [2024-11-17 05:47:03,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:47:03,972 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-17 05:47:03,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 05:47:03,975 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-17 05:47:03,976 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-17 05:47:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:47:04,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 05:47:04,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:47:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:47:04,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:47:04,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 05:47:04,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341156467] [2024-11-17 05:47:04,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341156467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:47:04,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 05:47:04,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 05:47:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667931297] [2024-11-17 05:47:04,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:47:04,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 05:47:04,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 05:47:04,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 05:47:04,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 05:47:04,101 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:47:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:47:04,114 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2024-11-17 05:47:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 05:47:04,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-17 05:47:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:47:04,122 INFO L225 Difference]: With dead ends: 48 [2024-11-17 05:47:04,122 INFO L226 Difference]: Without dead ends: 21 [2024-11-17 05:47:04,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 05:47:04,126 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:47:04,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:47:04,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-17 05:47:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-17 05:47:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 05:47:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-17 05:47:04,153 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2024-11-17 05:47:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:47:04,154 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-17 05:47:04,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:47:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-11-17 05:47:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 05:47:04,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:47:04,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:47:04,163 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-17 05:47:04,356 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-17 05:47:04,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:47:04,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:47:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash -859399346, now seen corresponding path program 1 times [2024-11-17 05:47:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 05:47:04,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186648354] [2024-11-17 05:47:04,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:47:04,358 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-17 05:47:04,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 05:47:04,359 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-17 05:47:04,360 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-17 05:47:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:47:04,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 05:47:04,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:47:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:47:04,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:47:04,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 05:47:04,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186648354] [2024-11-17 05:47:04,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186648354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:47:04,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 05:47:04,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 05:47:04,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527099776] [2024-11-17 05:47:04,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:47:04,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 05:47:04,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 05:47:04,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 05:47:04,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 05:47:04,477 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:47:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:47:04,488 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-17 05:47:04,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 05:47:04,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-17 05:47:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:47:04,490 INFO L225 Difference]: With dead ends: 21 [2024-11-17 05:47:04,490 INFO L226 Difference]: Without dead ends: 20 [2024-11-17 05:47:04,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-17 05:47:04,491 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:47:04,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:47:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-17 05:47:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-17 05:47:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 05:47:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-17 05:47:04,497 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2024-11-17 05:47:04,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:47:04,497 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-17 05:47:04,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:47:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-17 05:47:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 05:47:04,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:47:04,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:47:04,504 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-17 05:47:04,702 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-17 05:47:04,703 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:47:04,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:47:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash -871575969, now seen corresponding path program 1 times [2024-11-17 05:47:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 05:47:04,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162301263] [2024-11-17 05:47:04,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:47:04,704 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-17 05:47:04,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 05:47:04,707 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 05:47:04,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 05:47:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 05:47:04,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 05:47:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 05:47:04,820 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 05:47:04,821 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 05:47:04,821 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-17 05:47:04,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-17 05:47:04,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 05:47:05,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:47:05,026 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-17 05:47:05,056 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 05:47:05,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 05:47:05 BoogieIcfgContainer [2024-11-17 05:47:05,060 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 05:47:05,062 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 05:47:05,062 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 05:47:05,062 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 05:47:05,063 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:47:03" (3/4) ... [2024-11-17 05:47:05,086 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 05:47:05,087 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 05:47:05,087 INFO L158 Benchmark]: Toolchain (without parser) took 2479.43ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 40.4MB in the beginning and 64.7MB in the end (delta: -24.2MB). Peak memory consumption was 252.8kB. Max. memory is 16.1GB. [2024-11-17 05:47:05,089 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 52.4MB. Free memory was 27.1MB in the beginning and 27.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:47:05,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 846.99ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 40.2MB in the beginning and 55.0MB in the end (delta: -14.8MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-11-17 05:47:05,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.86ms. Allocated memory is still 96.5MB. Free memory was 55.0MB in the beginning and 52.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 05:47:05,092 INFO L158 Benchmark]: Boogie Preprocessor took 34.23ms. Allocated memory is still 96.5MB. Free memory was 52.2MB in the beginning and 49.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 05:47:05,092 INFO L158 Benchmark]: IcfgBuilder took 330.60ms. Allocated memory is still 96.5MB. Free memory was 49.1MB in the beginning and 60.3MB in the end (delta: -11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-17 05:47:05,096 INFO L158 Benchmark]: TraceAbstraction took 1193.57ms. Allocated memory is still 96.5MB. Free memory was 59.8MB in the beginning and 64.7MB in the end (delta: -4.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-11-17 05:47:05,097 INFO L158 Benchmark]: Witness Printer took 24.72ms. Allocated memory is still 96.5MB. Free memory was 64.7MB in the beginning and 64.7MB in the end (delta: 39.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 05:47:05,098 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.65ms. Allocated memory is still 52.4MB. Free memory was 27.1MB in the beginning and 27.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 846.99ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 40.2MB in the beginning and 55.0MB in the end (delta: -14.8MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.86ms. Allocated memory is still 96.5MB. Free memory was 55.0MB in the beginning and 52.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.23ms. Allocated memory is still 96.5MB. Free memory was 52.2MB in the beginning and 49.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 330.60ms. Allocated memory is still 96.5MB. Free memory was 49.1MB in the beginning and 60.3MB in the end (delta: -11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1193.57ms. Allocated memory is still 96.5MB. Free memory was 59.8MB in the beginning and 64.7MB in the end (delta: -4.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Witness Printer took 24.72ms. Allocated memory is still 96.5MB. Free memory was 64.7MB in the beginning and 64.7MB in the end (delta: 39.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1571]: 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 1580, 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] [L1580] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1580] 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] [L1581] CALL CWE190_Integer_Overflow__int_fgets_multiply_16_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] COND TRUE 1 [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) [L1567] COND TRUE 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1571] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1571]: 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 2 procedures, 29 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 29 SizeOfPredicates, 0 NumberOfNonLiveVariables, 106 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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-17 05:47:05,132 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