./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_13_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_13_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 5d60f9a08db3b87652018e486ddc4105f6a9b22587dceff6c844455431ed667b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 19:58:07,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 19:58:07,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-20 19:58:07,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 19:58:07,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 19:58:07,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 19:58:07,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 19:58:07,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 19:58:07,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 19:58:07,469 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 19:58:07,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 19:58:07,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 19:58:07,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 19:58:07,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 19:58:07,471 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 19:58:07,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 19:58:07,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 19:58:07,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 19:58:07,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 19:58:07,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 19:58:07,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 19:58:07,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 19:58:07,478 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 19:58:07,479 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 19:58:07,479 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 19:58:07,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 19:58:07,479 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 19:58:07,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 19:58:07,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 19:58:07,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 19:58:07,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 19:58:07,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:58:07,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 19:58:07,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 19:58:07,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 19:58:07,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 19:58:07,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 19:58:07,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 19:58:07,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 19:58:07,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 19:58:07,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 19:58:07,483 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 -> 5d60f9a08db3b87652018e486ddc4105f6a9b22587dceff6c844455431ed667b [2024-11-20 19:58:07,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 19:58:07,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 19:58:07,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 19:58:07,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 19:58:07,750 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 19:58:07,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_13_bad.i [2024-11-20 19:58:09,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 19:58:09,644 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 19:58:09,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_13_bad.i [2024-11-20 19:58:09,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7518d404/f139a464e5e04124a9ec0e0c56dc6b9b/FLAGaeec2ac28 [2024-11-20 19:58:09,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7518d404/f139a464e5e04124a9ec0e0c56dc6b9b [2024-11-20 19:58:09,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 19:58:09,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 19:58:09,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 19:58:09,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 19:58:09,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 19:58:09,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:58:09" (1/1) ... [2024-11-20 19:58:09,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b98a1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:09, skipping insertion in model container [2024-11-20 19:58:09,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:58:09" (1/1) ... [2024-11-20 19:58:09,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 19:58:10,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:58:10,546 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 19:58:10,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:58:10,747 INFO L204 MainTranslator]: Completed translation [2024-11-20 19:58:10,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:10 WrapperNode [2024-11-20 19:58:10,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 19:58:10,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 19:58:10,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 19:58:10,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 19:58:10,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:10" (1/1) ... [2024-11-20 19:58:10,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:10" (1/1) ... [2024-11-20 19:58:10,817 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2024-11-20 19:58:10,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 19:58:10,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 19:58:10,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 19:58:10,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 19:58:10,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:10" (1/1) ... [2024-11-20 19:58:10,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:10" (1/1) ... [2024-11-20 19:58:10,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:10" (1/1) ... [2024-11-20 19:58:10,856 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-20 19:58:10,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:10" (1/1) ... [2024-11-20 19:58:10,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:10" (1/1) ... [2024-11-20 19:58:10,862 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:10" (1/1) ... [2024-11-20 19:58:10,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:10" (1/1) ... [2024-11-20 19:58:10,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:10" (1/1) ... [2024-11-20 19:58:10,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:10" (1/1) ... [2024-11-20 19:58:10,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 19:58:10,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 19:58:10,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 19:58:10,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 19:58:10,875 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:10" (1/1) ... [2024-11-20 19:58:10,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:58:10,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:58:10,936 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-20 19:58:10,940 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-20 19:58:10,989 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-20 19:58:10,989 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-20 19:58:10,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 19:58:10,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 19:58:10,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 19:58:10,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 19:58:11,145 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 19:58:11,148 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 19:58:11,281 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 19:58:11,281 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 19:58:11,294 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 19:58:11,295 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 19:58:11,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:58:11 BoogieIcfgContainer [2024-11-20 19:58:11,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 19:58:11,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 19:58:11,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 19:58:11,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 19:58:11,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:58:09" (1/3) ... [2024-11-20 19:58:11,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd233a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:58:11, skipping insertion in model container [2024-11-20 19:58:11,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:10" (2/3) ... [2024-11-20 19:58:11,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd233a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:58:11, skipping insertion in model container [2024-11-20 19:58:11,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:58:11" (3/3) ... [2024-11-20 19:58:11,304 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_13_bad.i [2024-11-20 19:58:11,335 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 19:58:11,336 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 19:58:11,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 19:58:11,405 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;@1ff09868, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 19:58:11,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 19:58:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 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-20 19:58:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 19:58:11,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:58:11,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:58:11,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:58:11,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:58:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1958583963, now seen corresponding path program 1 times [2024-11-20 19:58:11,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:58:11,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708003807] [2024-11-20 19:58:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:58:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:11,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:58:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:11,751 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-20 19:58:11,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:58:11,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708003807] [2024-11-20 19:58:11,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708003807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:58:11,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:58:11,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 19:58:11,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467368897] [2024-11-20 19:58:11,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:58:11,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 19:58:11,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:58:11,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 19:58:11,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 19:58:11,787 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 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.0) internal successors, (9), 3 states have internal predecessors, (9), 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-20 19:58:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:58:11,820 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-20 19:58:11,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 19:58:11,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2024-11-20 19:58:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:58:11,828 INFO L225 Difference]: With dead ends: 41 [2024-11-20 19:58:11,828 INFO L226 Difference]: Without dead ends: 18 [2024-11-20 19:58:11,830 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-20 19:58:11,834 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 26 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-20 19:58:11,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 26 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:58:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-20 19:58:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-20 19:58:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) 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-20 19:58:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-20 19:58:11,870 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2024-11-20 19:58:11,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:58:11,872 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-20 19:58:11,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-20 19:58:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-20 19:58:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 19:58:11,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:58:11,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:58:11,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 19:58:11,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:58:11,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:58:11,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1014034784, now seen corresponding path program 1 times [2024-11-20 19:58:11,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:58:11,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821486638] [2024-11-20 19:58:11,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:11,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:58:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:12,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:58:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:12,030 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-20 19:58:12,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:58:12,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821486638] [2024-11-20 19:58:12,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821486638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:58:12,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:58:12,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 19:58:12,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119350068] [2024-11-20 19:58:12,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:58:12,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 19:58:12,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:58:12,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 19:58:12,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 19:58:12,036 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 19:58:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:58:12,046 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-11-20 19:58:12,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 19:58:12,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-20 19:58:12,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:58:12,048 INFO L225 Difference]: With dead ends: 18 [2024-11-20 19:58:12,048 INFO L226 Difference]: Without dead ends: 17 [2024-11-20 19:58:12,048 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-20 19:58:12,049 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:58:12,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 26 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:58:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-20 19:58:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-20 19:58:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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-20 19:58:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-20 19:58:12,058 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2024-11-20 19:58:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:58:12,058 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-20 19:58:12,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-20 19:58:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-20 19:58:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 19:58:12,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:58:12,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:58:12,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 19:58:12,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:58:12,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:58:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1370307168, now seen corresponding path program 1 times [2024-11-20 19:58:12,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:58:12,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539816145] [2024-11-20 19:58:12,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:12,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:58:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 19:58:12,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 19:58:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 19:58:12,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 19:58:12,160 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 19:58:12,161 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-20 19:58:12,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-20 19:58:12,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 19:58:12,170 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 19:58:12,195 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 19:58:12,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:58:12 BoogieIcfgContainer [2024-11-20 19:58:12,203 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 19:58:12,204 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 19:58:12,204 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 19:58:12,205 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 19:58:12,205 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:58:11" (3/4) ... [2024-11-20 19:58:12,207 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 19:58:12,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 19:58:12,211 INFO L158 Benchmark]: Toolchain (without parser) took 2510.88ms. Allocated memory is still 165.7MB. Free memory was 94.9MB in the beginning and 87.6MB in the end (delta: 7.2MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-11-20 19:58:12,212 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:58:12,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1045.52ms. Allocated memory is still 165.7MB. Free memory was 94.6MB in the beginning and 86.9MB in the end (delta: 7.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 19:58:12,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.70ms. Allocated memory is still 165.7MB. Free memory was 86.9MB in the beginning and 84.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 19:58:12,217 INFO L158 Benchmark]: Boogie Preprocessor took 49.84ms. Allocated memory is still 165.7MB. Free memory was 84.0MB in the beginning and 81.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 19:58:12,218 INFO L158 Benchmark]: RCFGBuilder took 421.90ms. Allocated memory is still 165.7MB. Free memory was 81.4MB in the beginning and 68.0MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 19:58:12,218 INFO L158 Benchmark]: TraceAbstraction took 906.17ms. Allocated memory is still 165.7MB. Free memory was 67.4MB in the beginning and 87.6MB in the end (delta: -20.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:58:12,218 INFO L158 Benchmark]: Witness Printer took 6.67ms. Allocated memory is still 165.7MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:58:12,220 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.14ms. Allocated memory is still 104.9MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1045.52ms. Allocated memory is still 165.7MB. Free memory was 94.6MB in the beginning and 86.9MB in the end (delta: 7.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.70ms. Allocated memory is still 165.7MB. Free memory was 86.9MB in the beginning and 84.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.84ms. Allocated memory is still 165.7MB. Free memory was 84.0MB in the beginning and 81.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 421.90ms. Allocated memory is still 165.7MB. Free memory was 81.4MB in the beginning and 68.0MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 906.17ms. Allocated memory is still 165.7MB. Free memory was 67.4MB in the beginning and 87.6MB in the end (delta: -20.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.67ms. Allocated memory is still 165.7MB. Free memory is still 87.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: 1569]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1578, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1578] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1578] 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] [L1579] CALL CWE190_Integer_Overflow__int_fgets_preinc_13_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE GLOBAL_CONST_FIVE==5 [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1566] COND TRUE GLOBAL_CONST_FIVE==5 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1569]: 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, 25 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 43 mSDtfsCounter, 5 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=25occurred 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, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 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-20 19:58:12,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_13_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 5d60f9a08db3b87652018e486ddc4105f6a9b22587dceff6c844455431ed667b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 19:58:14,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 19:58:14,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-20 19:58:14,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 19:58:14,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 19:58:14,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-20 19:58:14,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 19:58:14,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 19:58:14,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 19:58:14,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 19:58:14,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 19:58:14,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 19:58:14,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 19:58:14,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 19:58:14,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 19:58:14,646 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 19:58:14,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 19:58:14,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 19:58:14,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 19:58:14,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 19:58:14,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 19:58:14,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 19:58:14,651 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 19:58:14,651 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 19:58:14,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 19:58:14,652 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 19:58:14,652 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 19:58:14,652 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 19:58:14,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 19:58:14,653 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 19:58:14,653 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 19:58:14,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 19:58:14,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 19:58:14,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 19:58:14,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:58:14,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 19:58:14,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 19:58:14,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 19:58:14,658 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 19:58:14,658 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 19:58:14,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 19:58:14,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 19:58:14,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 19:58:14,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 19:58:14,661 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 -> 5d60f9a08db3b87652018e486ddc4105f6a9b22587dceff6c844455431ed667b [2024-11-20 19:58:14,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 19:58:14,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 19:58:14,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 19:58:14,991 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 19:58:14,991 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 19:58:14,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_13_bad.i [2024-11-20 19:58:16,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 19:58:16,925 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 19:58:16,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_13_bad.i [2024-11-20 19:58:16,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b78c987/b8ac7b71d3eb4417b0ba5ed1d62f83ef/FLAGc79cc2011 [2024-11-20 19:58:17,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b78c987/b8ac7b71d3eb4417b0ba5ed1d62f83ef [2024-11-20 19:58:17,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 19:58:17,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 19:58:17,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 19:58:17,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 19:58:17,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 19:58:17,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:58:17" (1/1) ... [2024-11-20 19:58:17,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fdfe60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:17, skipping insertion in model container [2024-11-20 19:58:17,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:58:17" (1/1) ... [2024-11-20 19:58:17,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 19:58:17,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:58:17,960 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 19:58:18,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:58:18,213 INFO L204 MainTranslator]: Completed translation [2024-11-20 19:58:18,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:18 WrapperNode [2024-11-20 19:58:18,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 19:58:18,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 19:58:18,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 19:58:18,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 19:58:18,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:18" (1/1) ... [2024-11-20 19:58:18,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:18" (1/1) ... [2024-11-20 19:58:18,303 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2024-11-20 19:58:18,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 19:58:18,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 19:58:18,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 19:58:18,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 19:58:18,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:18" (1/1) ... [2024-11-20 19:58:18,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:18" (1/1) ... [2024-11-20 19:58:18,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:18" (1/1) ... [2024-11-20 19:58:18,352 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-20 19:58:18,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:18" (1/1) ... [2024-11-20 19:58:18,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:18" (1/1) ... [2024-11-20 19:58:18,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:18" (1/1) ... [2024-11-20 19:58:18,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:18" (1/1) ... [2024-11-20 19:58:18,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:18" (1/1) ... [2024-11-20 19:58:18,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:18" (1/1) ... [2024-11-20 19:58:18,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 19:58:18,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 19:58:18,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 19:58:18,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 19:58:18,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:18" (1/1) ... [2024-11-20 19:58:18,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:58:18,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:58:18,420 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-20 19:58:18,425 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-20 19:58:18,471 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-20 19:58:18,472 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-20 19:58:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 19:58:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 19:58:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 19:58:18,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 19:58:18,626 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 19:58:18,629 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 19:58:18,763 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-20 19:58:18,763 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 19:58:18,772 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 19:58:18,772 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 19:58:18,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:58:18 BoogieIcfgContainer [2024-11-20 19:58:18,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 19:58:18,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 19:58:18,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 19:58:18,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 19:58:18,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:58:17" (1/3) ... [2024-11-20 19:58:18,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286bd68f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:58:18, skipping insertion in model container [2024-11-20 19:58:18,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:58:18" (2/3) ... [2024-11-20 19:58:18,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286bd68f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:58:18, skipping insertion in model container [2024-11-20 19:58:18,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:58:18" (3/3) ... [2024-11-20 19:58:18,782 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_13_bad.i [2024-11-20 19:58:18,798 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 19:58:18,798 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 19:58:18,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 19:58:18,859 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;@6224d693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 19:58:18,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 19:58:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 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-20 19:58:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 19:58:18,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:58:18,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:58:18,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:58:18,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:58:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1958583963, now seen corresponding path program 1 times [2024-11-20 19:58:18,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 19:58:18,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43330774] [2024-11-20 19:58:18,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:18,895 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-20 19:58:18,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 19:58:18,914 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-20 19:58:18,916 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-20 19:58:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:19,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 19:58:19,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:58:19,062 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-20 19:58:19,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:58:19,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 19:58:19,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43330774] [2024-11-20 19:58:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43330774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:58:19,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:58:19,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 19:58:19,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067397242] [2024-11-20 19:58:19,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:58:19,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 19:58:19,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 19:58:19,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 19:58:19,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 19:58:19,099 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 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-20 19:58:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:58:19,114 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-11-20 19:58:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 19:58:19,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (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 11 [2024-11-20 19:58:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:58:19,122 INFO L225 Difference]: With dead ends: 25 [2024-11-20 19:58:19,123 INFO L226 Difference]: Without dead ends: 17 [2024-11-20 19:58:19,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 19:58:19,131 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:58:19,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:58:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-20 19:58:19,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-20 19:58:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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-20 19:58:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-20 19:58:19,168 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2024-11-20 19:58:19,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:58:19,169 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-20 19:58:19,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (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-20 19:58:19,169 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-11-20 19:58:19,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 19:58:19,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:58:19,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:58:19,175 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-20 19:58:19,375 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-20 19:58:19,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:58:19,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:58:19,377 INFO L85 PathProgramCache]: Analyzing trace with hash -586560645, now seen corresponding path program 1 times [2024-11-20 19:58:19,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 19:58:19,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252506105] [2024-11-20 19:58:19,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:19,380 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-20 19:58:19,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 19:58:19,383 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-20 19:58:19,386 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-20 19:58:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:58:19,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 19:58:19,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:58:19,539 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-20 19:58:19,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:58:19,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 19:58:19,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252506105] [2024-11-20 19:58:19,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252506105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:58:19,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:58:19,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 19:58:19,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273823358] [2024-11-20 19:58:19,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:58:19,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 19:58:19,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 19:58:19,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 19:58:19,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 19:58:19,546 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. 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-20 19:58:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:58:19,560 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-20 19:58:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 19:58:19,561 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-20 19:58:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:58:19,562 INFO L225 Difference]: With dead ends: 21 [2024-11-20 19:58:19,562 INFO L226 Difference]: Without dead ends: 17 [2024-11-20 19:58:19,563 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-20 19:58:19,564 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:58:19,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:58:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-20 19:58:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-20 19:58:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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-20 19:58:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-20 19:58:19,573 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2024-11-20 19:58:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:58:19,574 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-20 19:58:19,574 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-20 19:58:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-20 19:58:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 19:58:19,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:58:19,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:58:19,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 19:58:19,779 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-20 19:58:19,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:58:19,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:58:19,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1370307168, now seen corresponding path program 1 times [2024-11-20 19:58:19,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 19:58:19,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506614633] [2024-11-20 19:58:19,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:58:19,782 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-20 19:58:19,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 19:58:19,787 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-20 19:58:19,789 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-20 19:58:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 19:58:19,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 19:58:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 19:58:19,943 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 19:58:19,943 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 19:58:19,945 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-20 19:58:19,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-20 19:58:19,955 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-20 19:58:20,150 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-20 19:58:20,154 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 19:58:20,193 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 19:58:20,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:58:20 BoogieIcfgContainer [2024-11-20 19:58:20,196 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 19:58:20,197 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 19:58:20,197 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 19:58:20,198 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 19:58:20,198 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:58:18" (3/4) ... [2024-11-20 19:58:20,201 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 19:58:20,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 19:58:20,203 INFO L158 Benchmark]: Toolchain (without parser) took 3046.47ms. Allocated memory was 73.4MB in the beginning and 90.2MB in the end (delta: 16.8MB). Free memory was 40.0MB in the beginning and 58.9MB in the end (delta: -18.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:58:20,203 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 48.2MB. Free memory is still 23.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:58:20,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1053.72ms. Allocated memory was 73.4MB in the beginning and 90.2MB in the end (delta: 16.8MB). Free memory was 39.8MB in the beginning and 40.7MB in the end (delta: -916.6kB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-20 19:58:20,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.36ms. Allocated memory is still 90.2MB. Free memory was 40.7MB in the beginning and 61.5MB in the end (delta: -20.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-20 19:58:20,205 INFO L158 Benchmark]: Boogie Preprocessor took 77.07ms. Allocated memory is still 90.2MB. Free memory was 61.5MB in the beginning and 58.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 19:58:20,205 INFO L158 Benchmark]: RCFGBuilder took 388.02ms. Allocated memory is still 90.2MB. Free memory was 58.9MB in the beginning and 43.8MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 19:58:20,206 INFO L158 Benchmark]: TraceAbstraction took 1421.45ms. Allocated memory is still 90.2MB. Free memory was 42.6MB in the beginning and 59.5MB in the end (delta: -16.9MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-11-20 19:58:20,206 INFO L158 Benchmark]: Witness Printer took 5.26ms. Allocated memory is still 90.2MB. Free memory was 59.5MB in the beginning and 58.9MB in the end (delta: 602.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:58:20,208 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.19ms. Allocated memory is still 48.2MB. Free memory is still 23.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1053.72ms. Allocated memory was 73.4MB in the beginning and 90.2MB in the end (delta: 16.8MB). Free memory was 39.8MB in the beginning and 40.7MB in the end (delta: -916.6kB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.36ms. Allocated memory is still 90.2MB. Free memory was 40.7MB in the beginning and 61.5MB in the end (delta: -20.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.07ms. Allocated memory is still 90.2MB. Free memory was 61.5MB in the beginning and 58.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 388.02ms. Allocated memory is still 90.2MB. Free memory was 58.9MB in the beginning and 43.8MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1421.45ms. Allocated memory is still 90.2MB. Free memory was 42.6MB in the beginning and 59.5MB in the end (delta: -16.9MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Witness Printer took 5.26ms. Allocated memory is still 90.2MB. Free memory was 59.5MB in the beginning and 58.9MB in the end (delta: 602.7kB). 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: 1569]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1578, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1578] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1578] 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] [L1579] CALL CWE190_Integer_Overflow__int_fgets_preinc_13_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE GLOBAL_CONST_FIVE==5 [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1566] COND TRUE GLOBAL_CONST_FIVE==5 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1569]: 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, 25 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 46 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 37 SizeOfPredicates, 0 NumberOfNonLiveVariables, 85 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 19:58:20,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample