./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_15_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_15_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 a3201307307e47fa08ad351bb3671e2a16c2d02ed34e995988ac10cf26b5ec0f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 05:49:06,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 05:49:06,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-17 05:49:06,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 05:49:06,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 05:49:06,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 05:49:06,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 05:49:06,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 05:49:06,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 05:49:06,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 05:49:06,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 05:49:06,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 05:49:06,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 05:49:06,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 05:49:06,477 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 05:49:06,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 05:49:06,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 05:49:06,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 05:49:06,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 05:49:06,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 05:49:06,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 05:49:06,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 05:49:06,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 05:49:06,479 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 05:49:06,480 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 05:49:06,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 05:49:06,480 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 05:49:06,480 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 05:49:06,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 05:49:06,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 05:49:06,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 05:49:06,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:49:06,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 05:49:06,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 05:49:06,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 05:49:06,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 05:49:06,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 05:49:06,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 05:49:06,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 05:49:06,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 05:49:06,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 05:49:06,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 -> a3201307307e47fa08ad351bb3671e2a16c2d02ed34e995988ac10cf26b5ec0f [2024-11-17 05:49:06,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 05:49:06,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 05:49:06,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 05:49:06,730 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 05:49:06,730 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 05:49:06,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_15_bad.i [2024-11-17 05:49:08,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 05:49:08,408 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 05:49:08,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_15_bad.i [2024-11-17 05:49:08,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3417366b1/50af97178cbb48c1bd591d4fd7603421/FLAG0e1a18990 [2024-11-17 05:49:08,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3417366b1/50af97178cbb48c1bd591d4fd7603421 [2024-11-17 05:49:08,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 05:49:08,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 05:49:08,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 05:49:08,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 05:49:08,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 05:49:08,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:49:08" (1/1) ... [2024-11-17 05:49:08,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3134c875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:08, skipping insertion in model container [2024-11-17 05:49:08,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:49:08" (1/1) ... [2024-11-17 05:49:08,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 05:49:09,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:49:09,339 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 05:49:09,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:49:09,501 INFO L204 MainTranslator]: Completed translation [2024-11-17 05:49:09,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:09 WrapperNode [2024-11-17 05:49:09,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 05:49:09,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 05:49:09,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 05:49:09,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 05:49:09,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:09" (1/1) ... [2024-11-17 05:49:09,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:09" (1/1) ... [2024-11-17 05:49:09,551 INFO L138 Inliner]: procedures = 498, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-11-17 05:49:09,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 05:49:09,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 05:49:09,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 05:49:09,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 05:49:09,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:09" (1/1) ... [2024-11-17 05:49:09,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:09" (1/1) ... [2024-11-17 05:49:09,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:09" (1/1) ... [2024-11-17 05:49:09,594 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-17 05:49:09,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:09" (1/1) ... [2024-11-17 05:49:09,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:09" (1/1) ... [2024-11-17 05:49:09,600 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:09" (1/1) ... [2024-11-17 05:49:09,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:09" (1/1) ... [2024-11-17 05:49:09,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:09" (1/1) ... [2024-11-17 05:49:09,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:09" (1/1) ... [2024-11-17 05:49:09,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 05:49:09,607 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 05:49:09,607 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 05:49:09,611 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 05:49:09,612 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:09" (1/1) ... [2024-11-17 05:49:09,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:49:09,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:49:09,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 05:49:09,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 05:49:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 05:49:09,692 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 05:49:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 05:49:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 05:49:09,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 05:49:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 05:49:09,810 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 05:49:09,815 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 05:49:09,933 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-17 05:49:09,933 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 05:49:09,943 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 05:49:09,943 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 05:49:09,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:49:09 BoogieIcfgContainer [2024-11-17 05:49:09,944 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 05:49:09,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 05:49:09,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 05:49:09,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 05:49:09,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 05:49:08" (1/3) ... [2024-11-17 05:49:09,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0d634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:49:09, skipping insertion in model container [2024-11-17 05:49:09,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:09" (2/3) ... [2024-11-17 05:49:09,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0d634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:49:09, skipping insertion in model container [2024-11-17 05:49:09,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:49:09" (3/3) ... [2024-11-17 05:49:09,951 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_15_bad.i [2024-11-17 05:49:09,965 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 05:49:09,965 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 05:49:10,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 05:49:10,023 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;@1fb2ad8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 05:49:10,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 05:49:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 05:49:10,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 05:49:10,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:49:10,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:49:10,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:49:10,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:49:10,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1751520704, now seen corresponding path program 1 times [2024-11-17 05:49:10,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:49:10,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717590337] [2024-11-17 05:49:10,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:49:10,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:49:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:49:10,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 05:49:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:49:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:49:10,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:49:10,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717590337] [2024-11-17 05:49:10,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717590337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:49:10,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 05:49:10,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 05:49:10,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151022931] [2024-11-17 05:49:10,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:49:10,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 05:49:10,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:49:10,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 05:49:10,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 05:49:10,286 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) 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-17 05:49:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:49:10,305 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-11-17 05:49:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 05:49:10,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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-17 05:49:10,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:49:10,318 INFO L225 Difference]: With dead ends: 53 [2024-11-17 05:49:10,318 INFO L226 Difference]: Without dead ends: 19 [2024-11-17 05:49:10,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 05:49:10,323 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:49:10,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:49:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-17 05:49:10,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-17 05:49:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 05:49:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-17 05:49:10,354 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2024-11-17 05:49:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:49:10,355 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-17 05:49:10,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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-17 05:49:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-17 05:49:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 05:49:10,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:49:10,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:49:10,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 05:49:10,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:49:10,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:49:10,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1484080278, now seen corresponding path program 1 times [2024-11-17 05:49:10,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:49:10,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694691307] [2024-11-17 05:49:10,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:49:10,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:49:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:49:10,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 05:49:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:49:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:49:10,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:49:10,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694691307] [2024-11-17 05:49:10,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694691307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:49:10,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 05:49:10,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 05:49:10,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505257110] [2024-11-17 05:49:10,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:49:10,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 05:49:10,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:49:10,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 05:49:10,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 05:49:10,475 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:49:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:49:10,483 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-17 05:49:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 05:49:10,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-17 05:49:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:49:10,485 INFO L225 Difference]: With dead ends: 19 [2024-11-17 05:49:10,485 INFO L226 Difference]: Without dead ends: 18 [2024-11-17 05:49:10,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 05:49:10,486 INFO L432 NwaCegarLoop]: 18 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, 27 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-17 05:49:10,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 27 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:49:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-17 05:49:10,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-17 05:49:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 05:49:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-17 05:49:10,490 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2024-11-17 05:49:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:49:10,490 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-17 05:49:10,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:49:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-17 05:49:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 05:49:10,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:49:10,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:49:10,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 05:49:10,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:49:10,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:49:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1238151650, now seen corresponding path program 1 times [2024-11-17 05:49:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:49:10,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27071882] [2024-11-17 05:49:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:49:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:49:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 05:49:10,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 05:49:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 05:49:10,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 05:49:10,545 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 05:49:10,546 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-17 05:49:10,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-17 05:49:10,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 05:49:10,550 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-17 05:49:10,566 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 05:49:10,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 05:49:10 BoogieIcfgContainer [2024-11-17 05:49:10,569 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 05:49:10,570 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 05:49:10,570 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 05:49:10,570 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 05:49:10,570 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:49:09" (3/4) ... [2024-11-17 05:49:10,572 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 05:49:10,573 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 05:49:10,574 INFO L158 Benchmark]: Toolchain (without parser) took 1961.52ms. Allocated memory is still 174.1MB. Free memory was 101.6MB in the beginning and 108.7MB in the end (delta: -7.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:49:10,574 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:49:10,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 879.88ms. Allocated memory is still 174.1MB. Free memory was 101.2MB in the beginning and 92.4MB in the end (delta: 8.9MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-11-17 05:49:10,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.04ms. Allocated memory is still 174.1MB. Free memory was 92.4MB in the beginning and 89.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 05:49:10,575 INFO L158 Benchmark]: Boogie Preprocessor took 54.28ms. Allocated memory is still 174.1MB. Free memory was 89.0MB in the beginning and 86.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 05:49:10,575 INFO L158 Benchmark]: IcfgBuilder took 336.43ms. Allocated memory is still 174.1MB. Free memory was 86.9MB in the beginning and 72.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 05:49:10,576 INFO L158 Benchmark]: TraceAbstraction took 623.83ms. Allocated memory is still 174.1MB. Free memory was 71.6MB in the beginning and 109.8MB in the end (delta: -38.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:49:10,576 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 174.1MB. Free memory was 109.6MB in the beginning and 108.7MB in the end (delta: 970.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 05:49:10,577 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 879.88ms. Allocated memory is still 174.1MB. Free memory was 101.2MB in the beginning and 92.4MB in the end (delta: 8.9MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.04ms. Allocated memory is still 174.1MB. Free memory was 92.4MB in the beginning and 89.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.28ms. Allocated memory is still 174.1MB. Free memory was 89.0MB in the beginning and 86.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 336.43ms. Allocated memory is still 174.1MB. Free memory was 86.9MB in the beginning and 72.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 623.83ms. Allocated memory is still 174.1MB. Free memory was 71.6MB in the beginning and 109.8MB in the end (delta: -38.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 174.1MB. Free memory was 109.6MB in the beginning and 108.7MB in the end (delta: 970.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1575]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1588. 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] [L1588] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={5:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1588] 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] [L1589] CALL CWE190_Integer_Overflow__int_fgets_preinc_15_bad() [L1550] int data; [L1551] data = 0 [L1554] case 6: 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] [L1554] case 6: [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] case 6: [L1559] data = atoi(inputBuffer) [L1573] case 7: 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] [L1575] ++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: 1575]: 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, 32 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 53 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 41 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 05:49:10,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_15_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 a3201307307e47fa08ad351bb3671e2a16c2d02ed34e995988ac10cf26b5ec0f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 05:49:13,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 05:49:13,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-17 05:49:13,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 05:49:13,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 05:49:13,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-17 05:49:13,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 05:49:13,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 05:49:13,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 05:49:13,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 05:49:13,229 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 05:49:13,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 05:49:13,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 05:49:13,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 05:49:13,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 05:49:13,231 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 05:49:13,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 05:49:13,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 05:49:13,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 05:49:13,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 05:49:13,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 05:49:13,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 05:49:13,235 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 05:49:13,235 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 05:49:13,239 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 05:49:13,239 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 05:49:13,239 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 05:49:13,240 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 05:49:13,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 05:49:13,240 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 05:49:13,240 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 05:49:13,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 05:49:13,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 05:49:13,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 05:49:13,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:49:13,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 05:49:13,241 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 05:49:13,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 05:49:13,242 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 05:49:13,242 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 05:49:13,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 05:49:13,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 05:49:13,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 05:49:13,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 05:49:13,245 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 -> a3201307307e47fa08ad351bb3671e2a16c2d02ed34e995988ac10cf26b5ec0f [2024-11-17 05:49:13,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 05:49:13,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 05:49:13,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 05:49:13,546 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 05:49:13,547 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 05:49:13,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_15_bad.i [2024-11-17 05:49:14,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 05:49:15,210 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 05:49:15,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_15_bad.i [2024-11-17 05:49:15,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025bd15bc/1ad15d21517f431ba6e5db9fb4b45bdf/FLAGf2870de56 [2024-11-17 05:49:15,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025bd15bc/1ad15d21517f431ba6e5db9fb4b45bdf [2024-11-17 05:49:15,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 05:49:15,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 05:49:15,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 05:49:15,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 05:49:15,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 05:49:15,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:49:15" (1/1) ... [2024-11-17 05:49:15,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a50ec73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:15, skipping insertion in model container [2024-11-17 05:49:15,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:49:15" (1/1) ... [2024-11-17 05:49:15,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 05:49:16,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:49:16,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 05:49:16,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:49:16,300 INFO L204 MainTranslator]: Completed translation [2024-11-17 05:49:16,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:16 WrapperNode [2024-11-17 05:49:16,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 05:49:16,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 05:49:16,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 05:49:16,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 05:49:16,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:16" (1/1) ... [2024-11-17 05:49:16,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:16" (1/1) ... [2024-11-17 05:49:16,361 INFO L138 Inliner]: procedures = 503, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2024-11-17 05:49:16,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 05:49:16,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 05:49:16,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 05:49:16,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 05:49:16,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:16" (1/1) ... [2024-11-17 05:49:16,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:16" (1/1) ... [2024-11-17 05:49:16,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:16" (1/1) ... [2024-11-17 05:49:16,395 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-17 05:49:16,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:16" (1/1) ... [2024-11-17 05:49:16,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:16" (1/1) ... [2024-11-17 05:49:16,403 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:16" (1/1) ... [2024-11-17 05:49:16,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:16" (1/1) ... [2024-11-17 05:49:16,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:16" (1/1) ... [2024-11-17 05:49:16,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:16" (1/1) ... [2024-11-17 05:49:16,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 05:49:16,415 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 05:49:16,417 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 05:49:16,417 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 05:49:16,418 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:16" (1/1) ... [2024-11-17 05:49:16,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:49:16,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:49:16,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 05:49:16,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 05:49:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 05:49:16,486 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 05:49:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 05:49:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 05:49:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 05:49:16,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 05:49:16,613 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 05:49:16,615 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 05:49:16,759 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-17 05:49:16,762 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 05:49:16,771 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 05:49:16,771 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 05:49:16,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:49:16 BoogieIcfgContainer [2024-11-17 05:49:16,772 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 05:49:16,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 05:49:16,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 05:49:16,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 05:49:16,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 05:49:15" (1/3) ... [2024-11-17 05:49:16,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa011b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:49:16, skipping insertion in model container [2024-11-17 05:49:16,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:49:16" (2/3) ... [2024-11-17 05:49:16,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa011b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:49:16, skipping insertion in model container [2024-11-17 05:49:16,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:49:16" (3/3) ... [2024-11-17 05:49:16,779 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_15_bad.i [2024-11-17 05:49:16,791 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 05:49:16,791 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 05:49:16,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 05:49:16,850 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;@415a5934, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 05:49:16,851 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 05:49:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 05:49:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 05:49:16,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:49:16,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:49:16,862 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:49:16,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:49:16,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1751520704, now seen corresponding path program 1 times [2024-11-17 05:49:16,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 05:49:16,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850863171] [2024-11-17 05:49:16,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:49:16,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:49:16,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 05:49:16,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 05:49:16,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 05:49:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:49:16,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 05:49:16,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:49:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:49:17,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:49:17,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 05:49:17,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850863171] [2024-11-17 05:49:17,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850863171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:49:17,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 05:49:17,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 05:49:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656342833] [2024-11-17 05:49:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:49:17,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 05:49:17,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 05:49:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 05:49:17,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 05:49:17,059 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:49:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:49:17,073 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2024-11-17 05:49:17,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 05:49:17,075 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-17 05:49:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:49:17,080 INFO L225 Difference]: With dead ends: 32 [2024-11-17 05:49:17,080 INFO L226 Difference]: Without dead ends: 20 [2024-11-17 05:49:17,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 05:49:17,087 INFO L432 NwaCegarLoop]: 40 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, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:49:17,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:49:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-17 05:49:17,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-17 05:49:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 05:49:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-17 05:49:17,115 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2024-11-17 05:49:17,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:49:17,116 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-17 05:49:17,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:49:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-17 05:49:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 05:49:17,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:49:17,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:49:17,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 05:49:17,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:49:17,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:49:17,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:49:17,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1537433012, now seen corresponding path program 1 times [2024-11-17 05:49:17,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 05:49:17,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772118110] [2024-11-17 05:49:17,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:49:17,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:49:17,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 05:49:17,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 05:49:17,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 05:49:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:49:17,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 05:49:17,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:49:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:49:17,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:49:17,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 05:49:17,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772118110] [2024-11-17 05:49:17,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772118110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:49:17,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 05:49:17,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 05:49:17,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912690848] [2024-11-17 05:49:17,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:49:17,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 05:49:17,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 05:49:17,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 05:49:17,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 05:49:17,440 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:49:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:49:17,449 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-17 05:49:17,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 05:49:17,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-17 05:49:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:49:17,450 INFO L225 Difference]: With dead ends: 29 [2024-11-17 05:49:17,450 INFO L226 Difference]: Without dead ends: 18 [2024-11-17 05:49:17,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 05:49:17,451 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:49:17,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:49:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-17 05:49:17,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-17 05:49:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 05:49:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-17 05:49:17,454 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2024-11-17 05:49:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:49:17,454 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-17 05:49:17,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:49:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-17 05:49:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 05:49:17,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:49:17,455 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:49:17,459 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-17 05:49:17,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:49:17,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:49:17,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:49:17,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1238151650, now seen corresponding path program 1 times [2024-11-17 05:49:17,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 05:49:17,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354102088] [2024-11-17 05:49:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:49:17,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:49:17,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 05:49:17,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 05:49:17,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 05:49:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 05:49:17,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 05:49:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 05:49:17,786 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 05:49:17,787 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 05:49:17,788 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-17 05:49:17,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-17 05:49:17,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 05:49:17,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:49:17,994 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-17 05:49:18,022 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 05:49:18,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 05:49:18 BoogieIcfgContainer [2024-11-17 05:49:18,025 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 05:49:18,025 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 05:49:18,025 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 05:49:18,026 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 05:49:18,026 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:49:16" (3/4) ... [2024-11-17 05:49:18,028 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 05:49:18,029 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 05:49:18,030 INFO L158 Benchmark]: Toolchain (without parser) took 2780.14ms. Allocated memory was 60.8MB in the beginning and 121.6MB in the end (delta: 60.8MB). Free memory was 26.0MB in the beginning and 90.5MB in the end (delta: -64.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:49:18,030 INFO L158 Benchmark]: CDTParser took 1.22ms. Allocated memory is still 46.1MB. Free memory is still 24.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:49:18,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1050.09ms. Allocated memory was 60.8MB in the beginning and 86.0MB in the end (delta: 25.2MB). Free memory was 25.6MB in the beginning and 45.5MB in the end (delta: -19.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-17 05:49:18,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.07ms. Allocated memory is still 86.0MB. Free memory was 45.5MB in the beginning and 42.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 05:49:18,031 INFO L158 Benchmark]: Boogie Preprocessor took 51.03ms. Allocated memory is still 86.0MB. Free memory was 42.2MB in the beginning and 39.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 05:49:18,031 INFO L158 Benchmark]: IcfgBuilder took 357.33ms. Allocated memory is still 86.0MB. Free memory was 39.3MB in the beginning and 45.6MB in the end (delta: -6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 05:49:18,032 INFO L158 Benchmark]: TraceAbstraction took 1251.06ms. Allocated memory was 86.0MB in the beginning and 121.6MB in the end (delta: 35.7MB). Free memory was 44.9MB in the beginning and 91.2MB in the end (delta: -46.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-11-17 05:49:18,032 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 121.6MB. Free memory was 91.2MB in the beginning and 90.5MB in the end (delta: 711.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:49:18,034 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22ms. Allocated memory is still 46.1MB. Free memory is still 24.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1050.09ms. Allocated memory was 60.8MB in the beginning and 86.0MB in the end (delta: 25.2MB). Free memory was 25.6MB in the beginning and 45.5MB in the end (delta: -19.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.07ms. Allocated memory is still 86.0MB. Free memory was 45.5MB in the beginning and 42.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.03ms. Allocated memory is still 86.0MB. Free memory was 42.2MB in the beginning and 39.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 357.33ms. Allocated memory is still 86.0MB. Free memory was 39.3MB in the beginning and 45.6MB in the end (delta: -6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1251.06ms. Allocated memory was 86.0MB in the beginning and 121.6MB in the end (delta: 35.7MB). Free memory was 44.9MB in the beginning and 91.2MB in the end (delta: -46.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 121.6MB. Free memory was 91.2MB in the beginning and 90.5MB in the end (delta: 711.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1575]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1588. 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] [L1588] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={5:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1588] 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] [L1589] CALL CWE190_Integer_Overflow__int_fgets_preinc_15_bad() [L1550] int data; [L1551] data = 0 [L1554] case 6: 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] [L1554] case 6: [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] case 6: [L1559] data = atoi(inputBuffer) [L1573] case 7: 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] [L1575] ++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: 1575]: 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, 32 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 59 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 25 SizeOfPredicates, 0 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 05:49:18,070 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