./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_07_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_07_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 671d705a70336356947a97806e14e6e59074b41604d6d754fbc520319aac2b10 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 13:05:36,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 13:05:36,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 13:05:36,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 13:05:36,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 13:05:36,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 13:05:36,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 13:05:36,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 13:05:36,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 13:05:36,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 13:05:36,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 13:05:36,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 13:05:36,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 13:05:36,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 13:05:36,334 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 13:05:36,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 13:05:36,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 13:05:36,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 13:05:36,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 13:05:36,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 13:05:36,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 13:05:36,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 13:05:36,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 13:05:36,342 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 13:05:36,342 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 13:05:36,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 13:05:36,342 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 13:05:36,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 13:05:36,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 13:05:36,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 13:05:36,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 13:05:36,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:05:36,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 13:05:36,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 13:05:36,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 13:05:36,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 13:05:36,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 13:05:36,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 13:05:36,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 13:05:36,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 13:05:36,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 13:05:36,350 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 -> 671d705a70336356947a97806e14e6e59074b41604d6d754fbc520319aac2b10 [2024-11-09 13:05:36,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 13:05:36,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 13:05:36,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 13:05:36,634 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 13:05:36,634 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 13:05:36,636 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_07_bad.i [2024-11-09 13:05:38,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 13:05:38,446 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 13:05:38,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_07_bad.i [2024-11-09 13:05:38,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad286091/c257bd9252b348aea74280791e5944df/FLAG0d0bf417b [2024-11-09 13:05:38,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad286091/c257bd9252b348aea74280791e5944df [2024-11-09 13:05:38,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 13:05:38,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 13:05:38,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 13:05:38,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 13:05:38,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 13:05:38,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:05:38" (1/1) ... [2024-11-09 13:05:38,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7473005d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:38, skipping insertion in model container [2024-11-09 13:05:38,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:05:38" (1/1) ... [2024-11-09 13:05:38,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 13:05:39,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:05:39,534 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 13:05:39,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:05:39,711 INFO L204 MainTranslator]: Completed translation [2024-11-09 13:05:39,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:39 WrapperNode [2024-11-09 13:05:39,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 13:05:39,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 13:05:39,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 13:05:39,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 13:05:39,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:39" (1/1) ... [2024-11-09 13:05:39,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:39" (1/1) ... [2024-11-09 13:05:39,766 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2024-11-09 13:05:39,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 13:05:39,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 13:05:39,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 13:05:39,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 13:05:39,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:39" (1/1) ... [2024-11-09 13:05:39,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:39" (1/1) ... [2024-11-09 13:05:39,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:39" (1/1) ... [2024-11-09 13:05:39,796 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-09 13:05:39,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:39" (1/1) ... [2024-11-09 13:05:39,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:39" (1/1) ... [2024-11-09 13:05:39,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:39" (1/1) ... [2024-11-09 13:05:39,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:39" (1/1) ... [2024-11-09 13:05:39,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:39" (1/1) ... [2024-11-09 13:05:39,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:39" (1/1) ... [2024-11-09 13:05:39,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 13:05:39,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 13:05:39,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 13:05:39,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 13:05:39,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:39" (1/1) ... [2024-11-09 13:05:39,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:05:39,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 13:05:39,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 13:05:39,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 13:05:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 13:05:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 13:05:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 13:05:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 13:05:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 13:05:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 13:05:40,058 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 13:05:40,061 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 13:05:40,191 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-09 13:05:40,192 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 13:05:40,205 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 13:05:40,205 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 13:05:40,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:05:40 BoogieIcfgContainer [2024-11-09 13:05:40,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 13:05:40,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 13:05:40,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 13:05:40,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 13:05:40,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:05:38" (1/3) ... [2024-11-09 13:05:40,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d696f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:05:40, skipping insertion in model container [2024-11-09 13:05:40,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:39" (2/3) ... [2024-11-09 13:05:40,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d696f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:05:40, skipping insertion in model container [2024-11-09 13:05:40,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:05:40" (3/3) ... [2024-11-09 13:05:40,212 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_07_bad.i [2024-11-09 13:05:40,225 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 13:05:40,225 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 13:05:40,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 13:05:40,279 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;@318e07e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 13:05:40,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 13:05:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 21 states have internal predecessors, (26), 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-09 13:05:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 13:05:40,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:05:40,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:05:40,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:05:40,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:05:40,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1593866737, now seen corresponding path program 1 times [2024-11-09 13:05:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:05:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036010307] [2024-11-09 13:05:40,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:05:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:05:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:05:40,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 13:05:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:05:40,545 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-09 13:05:40,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 13:05:40,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036010307] [2024-11-09 13:05:40,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036010307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:05:40,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:05:40,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 13:05:40,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329012753] [2024-11-09 13:05:40,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:05:40,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:05:40,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 13:05:40,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:05:40,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:05:40,571 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 21 states have internal predecessors, (26), 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 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-09 13:05:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:05:40,618 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-09 13:05:40,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:05:40,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-11-09 13:05:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:05:40,628 INFO L225 Difference]: With dead ends: 43 [2024-11-09 13:05:40,628 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 13:05:40,631 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-09 13:05:40,636 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 13:05:40,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:05:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 13:05:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 13:05:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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-09 13:05:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-09 13:05:40,687 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2024-11-09 13:05:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:05:40,688 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-09 13:05:40,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-09 13:05:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-09 13:05:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 13:05:40,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:05:40,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:05:40,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 13:05:40,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:05:40,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:05:40,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1271116596, now seen corresponding path program 1 times [2024-11-09 13:05:40,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:05:40,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658321409] [2024-11-09 13:05:40,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:05:40,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:05:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:05:40,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 13:05:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:05:40,855 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-09 13:05:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 13:05:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658321409] [2024-11-09 13:05:40,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658321409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:05:40,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:05:40,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 13:05:40,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814140758] [2024-11-09 13:05:40,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:05:40,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:05:40,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 13:05:40,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:05:40,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:05:40,859 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-09 13:05:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:05:40,868 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-09 13:05:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:05:40,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-11-09 13:05:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:05:40,870 INFO L225 Difference]: With dead ends: 19 [2024-11-09 13:05:40,870 INFO L226 Difference]: Without dead ends: 18 [2024-11-09 13:05:40,870 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-09 13:05:40,872 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 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-09 13:05:40,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:05:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-09 13:05:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-09 13:05:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-09 13:05:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-09 13:05:40,880 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2024-11-09 13:05:40,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:05:40,880 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-09 13:05:40,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-09 13:05:40,881 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-09 13:05:40,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 13:05:40,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:05:40,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:05:40,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 13:05:40,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:05:40,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:05:40,883 INFO L85 PathProgramCache]: Analyzing trace with hash 749908879, now seen corresponding path program 1 times [2024-11-09 13:05:40,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:05:40,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676042034] [2024-11-09 13:05:40,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:05:40,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:05:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:05:40,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 13:05:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:05:40,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 13:05:40,965 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 13:05:40,966 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 13:05:40,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 13:05:40,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 13:05:40,970 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 13:05:40,988 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 13:05:40,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:05:40 BoogieIcfgContainer [2024-11-09 13:05:40,991 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 13:05:40,991 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 13:05:40,991 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 13:05:40,992 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 13:05:40,992 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:05:40" (3/4) ... [2024-11-09 13:05:40,994 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 13:05:40,995 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 13:05:40,995 INFO L158 Benchmark]: Toolchain (without parser) took 2289.52ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 57.8MB in the beginning and 123.7MB in the end (delta: -66.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:05:40,996 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 130.0MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:05:40,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1004.86ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 57.4MB in the beginning and 95.8MB in the end (delta: -38.4MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-11-09 13:05:40,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.11ms. Allocated memory is still 184.5MB. Free memory was 95.8MB in the beginning and 92.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:05:40,997 INFO L158 Benchmark]: Boogie Preprocessor took 44.25ms. Allocated memory is still 184.5MB. Free memory was 92.7MB in the beginning and 90.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:05:40,998 INFO L158 Benchmark]: RCFGBuilder took 392.87ms. Allocated memory is still 184.5MB. Free memory was 90.6MB in the beginning and 77.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 13:05:40,998 INFO L158 Benchmark]: TraceAbstraction took 783.51ms. Allocated memory is still 184.5MB. Free memory was 75.9MB in the beginning and 124.8MB in the end (delta: -48.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:05:40,999 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 184.5MB. Free memory was 124.8MB in the beginning and 123.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:05:41,001 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.20ms. Allocated memory is still 130.0MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1004.86ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 57.4MB in the beginning and 95.8MB in the end (delta: -38.4MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.11ms. Allocated memory is still 184.5MB. Free memory was 95.8MB in the beginning and 92.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.25ms. Allocated memory is still 184.5MB. Free memory was 92.7MB in the beginning and 90.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 392.87ms. Allocated memory is still 184.5MB. Free memory was 90.6MB in the beginning and 77.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 783.51ms. Allocated memory is still 184.5MB. Free memory was 75.9MB in the beginning and 124.8MB in the end (delta: -48.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 184.5MB. Free memory was 124.8MB in the beginning and 123.7MB in the end (delta: 1.0MB). 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 1559, overapproximation of large string literal at line 1579, overapproximation of fgets at line 1557. 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); [L1548] static int staticFive = 5; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1579] 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, staticFive=5] [L1414] COND TRUE line != ((void *)0) [L1579] 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, staticFive=5] [L1580] CALL CWE190_Integer_Overflow__int_fgets_multiply_07_bad() [L1551] int data; [L1552] 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, staticFive=5] [L1553] COND TRUE staticFive==5 [L1556] 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, staticFive=5] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1567] COND TRUE staticFive==5 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, staticFive=5] [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, staticFive=5] [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, staticFive=5] - 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, 26 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 46 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 34 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-09 13:05:41,042 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_07_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 671d705a70336356947a97806e14e6e59074b41604d6d754fbc520319aac2b10 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 13:05:43,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 13:05:43,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-09 13:05:43,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 13:05:43,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 13:05:43,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-09 13:05:43,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 13:05:43,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 13:05:43,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 13:05:43,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 13:05:43,345 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 13:05:43,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 13:05:43,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 13:05:43,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 13:05:43,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 13:05:43,348 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 13:05:43,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 13:05:43,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 13:05:43,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 13:05:43,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 13:05:43,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 13:05:43,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 13:05:43,355 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 13:05:43,355 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 13:05:43,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 13:05:43,356 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 13:05:43,356 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 13:05:43,356 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 13:05:43,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 13:05:43,357 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 13:05:43,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 13:05:43,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 13:05:43,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 13:05:43,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 13:05:43,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:05:43,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 13:05:43,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 13:05:43,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 13:05:43,360 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 13:05:43,360 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 13:05:43,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 13:05:43,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 13:05:43,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 13:05:43,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 13:05:43,364 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 -> 671d705a70336356947a97806e14e6e59074b41604d6d754fbc520319aac2b10 [2024-11-09 13:05:43,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 13:05:43,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 13:05:43,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 13:05:43,715 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 13:05:43,715 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 13:05:43,716 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_07_bad.i [2024-11-09 13:05:45,233 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 13:05:45,601 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 13:05:45,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_07_bad.i [2024-11-09 13:05:45,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd90fa06/a48474e3f7c84faf9997b29546a55c44/FLAG250ed5fa5 [2024-11-09 13:05:45,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd90fa06/a48474e3f7c84faf9997b29546a55c44 [2024-11-09 13:05:45,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 13:05:45,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 13:05:45,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 13:05:45,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 13:05:45,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 13:05:45,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:05:45" (1/1) ... [2024-11-09 13:05:45,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55471f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:45, skipping insertion in model container [2024-11-09 13:05:45,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:05:45" (1/1) ... [2024-11-09 13:05:45,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 13:05:46,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:05:46,647 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 13:05:46,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:05:46,933 INFO L204 MainTranslator]: Completed translation [2024-11-09 13:05:46,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:46 WrapperNode [2024-11-09 13:05:46,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 13:05:46,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 13:05:46,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 13:05:46,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 13:05:46,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:46" (1/1) ... [2024-11-09 13:05:46,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:46" (1/1) ... [2024-11-09 13:05:47,007 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2024-11-09 13:05:47,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 13:05:47,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 13:05:47,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 13:05:47,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 13:05:47,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:46" (1/1) ... [2024-11-09 13:05:47,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:46" (1/1) ... [2024-11-09 13:05:47,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:46" (1/1) ... [2024-11-09 13:05:47,050 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-09 13:05:47,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:46" (1/1) ... [2024-11-09 13:05:47,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:46" (1/1) ... [2024-11-09 13:05:47,058 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:46" (1/1) ... [2024-11-09 13:05:47,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:46" (1/1) ... [2024-11-09 13:05:47,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:46" (1/1) ... [2024-11-09 13:05:47,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:46" (1/1) ... [2024-11-09 13:05:47,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 13:05:47,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 13:05:47,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 13:05:47,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 13:05:47,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:46" (1/1) ... [2024-11-09 13:05:47,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:05:47,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 13:05:47,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 13:05:47,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 13:05:47,160 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 13:05:47,160 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 13:05:47,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 13:05:47,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 13:05:47,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 13:05:47,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 13:05:47,352 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 13:05:47,356 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 13:05:47,535 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-09 13:05:47,536 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 13:05:47,550 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 13:05:47,550 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 13:05:47,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:05:47 BoogieIcfgContainer [2024-11-09 13:05:47,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 13:05:47,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 13:05:47,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 13:05:47,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 13:05:47,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:05:45" (1/3) ... [2024-11-09 13:05:47,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2ea733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:05:47, skipping insertion in model container [2024-11-09 13:05:47,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:46" (2/3) ... [2024-11-09 13:05:47,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2ea733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:05:47, skipping insertion in model container [2024-11-09 13:05:47,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:05:47" (3/3) ... [2024-11-09 13:05:47,561 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_07_bad.i [2024-11-09 13:05:47,578 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 13:05:47,579 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 13:05:47,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 13:05:47,656 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5cdc895, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 13:05:47,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 13:05:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 21 states have internal predecessors, (26), 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-09 13:05:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 13:05:47,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:05:47,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:05:47,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:05:47,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:05:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1593866737, now seen corresponding path program 1 times [2024-11-09 13:05:47,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:05:47,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739781086] [2024-11-09 13:05:47,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:05:47,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 13:05:47,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:05:47,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 13:05:47,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 13:05:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:05:47,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 13:05:47,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 13:05:47,871 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-09 13:05:47,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 13:05:47,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 13:05:47,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739781086] [2024-11-09 13:05:47,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739781086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:05:47,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:05:47,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 13:05:47,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537766207] [2024-11-09 13:05:47,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:05:47,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:05:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 13:05:47,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:05:47,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:05:47,907 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 21 states have internal predecessors, (26), 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 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-09 13:05:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:05:47,945 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-09 13:05:47,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:05:47,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 12 [2024-11-09 13:05:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:05:47,955 INFO L225 Difference]: With dead ends: 43 [2024-11-09 13:05:47,955 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 13:05:47,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:05:47,962 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 13:05:47,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:05:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 13:05:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 13:05:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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-09 13:05:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-09 13:05:47,998 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2024-11-09 13:05:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:05:48,001 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-09 13:05:48,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-09 13:05:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-09 13:05:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 13:05:48,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:05:48,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:05:48,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 13:05:48,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 13:05:48,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:05:48,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:05:48,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1271116596, now seen corresponding path program 1 times [2024-11-09 13:05:48,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:05:48,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116017167] [2024-11-09 13:05:48,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:05:48,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 13:05:48,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:05:48,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 13:05:48,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 13:05:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:05:48,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 13:05:48,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 13:05:48,443 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-09 13:05:48,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 13:05:48,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 13:05:48,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116017167] [2024-11-09 13:05:48,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116017167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:05:48,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:05:48,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 13:05:48,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581667189] [2024-11-09 13:05:48,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:05:48,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:05:48,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 13:05:48,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:05:48,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:05:48,451 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-09 13:05:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:05:48,468 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-09 13:05:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:05:48,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-11-09 13:05:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:05:48,470 INFO L225 Difference]: With dead ends: 19 [2024-11-09 13:05:48,471 INFO L226 Difference]: Without dead ends: 18 [2024-11-09 13:05:48,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:05:48,472 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 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-09 13:05:48,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:05:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-09 13:05:48,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-09 13:05:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-09 13:05:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-09 13:05:48,481 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2024-11-09 13:05:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:05:48,482 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-09 13:05:48,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-09 13:05:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-09 13:05:48,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 13:05:48,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:05:48,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:05:48,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 13:05:48,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 13:05:48,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:05:48,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:05:48,686 INFO L85 PathProgramCache]: Analyzing trace with hash 749908879, now seen corresponding path program 1 times [2024-11-09 13:05:48,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:05:48,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498904890] [2024-11-09 13:05:48,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:05:48,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 13:05:48,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:05:48,689 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-09 13:05:48,690 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-09 13:05:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:05:48,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 13:05:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:05:48,845 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 13:05:48,846 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 13:05:48,847 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 13:05:48,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 13:05:48,856 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-09 13:05:49,049 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-09 13:05:49,052 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 13:05:49,075 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 13:05:49,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:05:49 BoogieIcfgContainer [2024-11-09 13:05:49,078 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 13:05:49,078 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 13:05:49,079 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 13:05:49,079 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 13:05:49,079 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:05:47" (3/4) ... [2024-11-09 13:05:49,082 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 13:05:49,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 13:05:49,083 INFO L158 Benchmark]: Toolchain (without parser) took 3252.18ms. Allocated memory was 60.8MB in the beginning and 107.0MB in the end (delta: 46.1MB). Free memory was 37.9MB in the beginning and 51.6MB in the end (delta: -13.8MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-11-09 13:05:49,084 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 39.8MB. Free memory is still 21.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:05:49,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1103.58ms. Allocated memory was 60.8MB in the beginning and 83.9MB in the end (delta: 23.1MB). Free memory was 37.7MB in the beginning and 46.1MB in the end (delta: -8.4MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-09 13:05:49,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.19ms. Allocated memory is still 83.9MB. Free memory was 46.1MB in the beginning and 42.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 13:05:49,085 INFO L158 Benchmark]: Boogie Preprocessor took 61.67ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 40.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:05:49,085 INFO L158 Benchmark]: RCFGBuilder took 479.76ms. Allocated memory is still 83.9MB. Free memory was 40.2MB in the beginning and 46.5MB in the end (delta: -6.2MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-11-09 13:05:49,086 INFO L158 Benchmark]: TraceAbstraction took 1525.20ms. Allocated memory was 83.9MB in the beginning and 107.0MB in the end (delta: 23.1MB). Free memory was 46.0MB in the beginning and 51.6MB in the end (delta: -5.6MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-11-09 13:05:49,086 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 107.0MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:05:49,088 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.34ms. Allocated memory is still 39.8MB. Free memory is still 21.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1103.58ms. Allocated memory was 60.8MB in the beginning and 83.9MB in the end (delta: 23.1MB). Free memory was 37.7MB in the beginning and 46.1MB in the end (delta: -8.4MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.19ms. Allocated memory is still 83.9MB. Free memory was 46.1MB in the beginning and 42.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.67ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 40.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 479.76ms. Allocated memory is still 83.9MB. Free memory was 40.2MB in the beginning and 46.5MB in the end (delta: -6.2MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1525.20ms. Allocated memory was 83.9MB in the beginning and 107.0MB in the end (delta: 23.1MB). Free memory was 46.0MB in the beginning and 51.6MB in the end (delta: -5.6MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 107.0MB. Free memory is still 51.6MB. 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 1559, overapproximation of large string literal at line 1579, overapproximation of fgets at line 1557. 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); [L1548] static int staticFive = 5; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1579] 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, staticFive=5] [L1414] COND TRUE line != ((void *)0) [L1579] 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, staticFive=5] [L1580] CALL CWE190_Integer_Overflow__int_fgets_multiply_07_bad() [L1551] int data; [L1552] 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, staticFive=5] [L1553] COND TRUE staticFive==5 [L1556] 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, staticFive=5] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1567] COND TRUE staticFive==5 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, staticFive=5] [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, staticFive=5] [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, staticFive=5] - 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, 26 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 46 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 SizeOfPredicates, 0 NumberOfNonLiveVariables, 106 ConjunctsInSsa, 4 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-09 13:05:49,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample