./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_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 2d42bc4029b22d5fbac4ec556f66bb794bd4efb484b2f7343472d3031f33fa34 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 14:29:17,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 14:29:17,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 14:29:17,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 14:29:17,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 14:29:17,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 14:29:17,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 14:29:17,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 14:29:17,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 14:29:17,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 14:29:17,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 14:29:17,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 14:29:17,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 14:29:17,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 14:29:17,947 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 14:29:17,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 14:29:17,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 14:29:17,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 14:29:17,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 14:29:17,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 14:29:17,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 14:29:17,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 14:29:17,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 14:29:17,950 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 14:29:17,950 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 14:29:17,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 14:29:17,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 14:29:17,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 14:29:17,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 14:29:17,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 14:29:17,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 14:29:17,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:29:17,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 14:29:17,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 14:29:17,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 14:29:17,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 14:29:17,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 14:29:17,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 14:29:17,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 14:29:17,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 14:29:17,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 14:29:17,955 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 -> 2d42bc4029b22d5fbac4ec556f66bb794bd4efb484b2f7343472d3031f33fa34 [2024-11-09 14:29:18,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:29:18,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:29:18,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:29:18,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:29:18,203 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:29:18,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_bad.i [2024-11-09 14:29:19,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:29:19,635 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:29:19,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_bad.i [2024-11-09 14:29:19,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6d0fee2/17ad6ab99b5e477ab9f0780154a9d76a/FLAG8e9c38ed7 [2024-11-09 14:29:19,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6d0fee2/17ad6ab99b5e477ab9f0780154a9d76a [2024-11-09 14:29:19,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:29:19,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:29:19,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:29:19,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:29:19,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:29:19,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:29:19" (1/1) ... [2024-11-09 14:29:19,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc5cb56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:19, skipping insertion in model container [2024-11-09 14:29:19,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:29:19" (1/1) ... [2024-11-09 14:29:20,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:29:20,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:29:20,544 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:29:20,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:29:20,663 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:29:20,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:20 WrapperNode [2024-11-09 14:29:20,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:29:20,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:29:20,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:29:20,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:29:20,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:20" (1/1) ... [2024-11-09 14:29:20,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:20" (1/1) ... [2024-11-09 14:29:20,710 INFO L138 Inliner]: procedures = 497, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2024-11-09 14:29:20,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:29:20,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:29:20,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:29:20,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:29:20,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:20" (1/1) ... [2024-11-09 14:29:20,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:20" (1/1) ... [2024-11-09 14:29:20,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:20" (1/1) ... [2024-11-09 14:29:20,730 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 14:29:20,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:20" (1/1) ... [2024-11-09 14:29:20,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:20" (1/1) ... [2024-11-09 14:29:20,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:20" (1/1) ... [2024-11-09 14:29:20,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:20" (1/1) ... [2024-11-09 14:29:20,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:20" (1/1) ... [2024-11-09 14:29:20,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:20" (1/1) ... [2024-11-09 14:29:20,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:29:20,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:29:20,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:29:20,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:29:20,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:20" (1/1) ... [2024-11-09 14:29:20,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:29:20,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:29:20,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 14:29:20,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 14:29:20,823 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 14:29:20,824 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 14:29:20,824 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-11-09 14:29:20,824 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-11-09 14:29:20,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:29:20,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:29:20,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:29:20,932 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:29:20,933 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:29:21,071 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-09 14:29:21,071 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:29:21,083 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:29:21,084 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 14:29:21,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:29:21 BoogieIcfgContainer [2024-11-09 14:29:21,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:29:21,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:29:21,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:29:21,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:29:21,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:29:19" (1/3) ... [2024-11-09 14:29:21,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa58604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:29:21, skipping insertion in model container [2024-11-09 14:29:21,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:20" (2/3) ... [2024-11-09 14:29:21,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa58604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:29:21, skipping insertion in model container [2024-11-09 14:29:21,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:29:21" (3/3) ... [2024-11-09 14:29:21,093 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_sub_11_bad.i [2024-11-09 14:29:21,104 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:29:21,105 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 14:29:21,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:29:21,162 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;@dbcc2d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:29:21,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 14:29:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 43 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 14:29:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 14:29:21,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:29:21,178 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:29:21,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 14:29:21,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:29:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1648115636, now seen corresponding path program 1 times [2024-11-09 14:29:21,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:29:21,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137786911] [2024-11-09 14:29:21,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:29:21,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:29:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 14:29:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:21,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 14:29:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 14:29:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 14:29:21,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:29:21,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137786911] [2024-11-09 14:29:21,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137786911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:29:21,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305150859] [2024-11-09 14:29:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:29:21,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:29:21,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:29:21,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:29:21,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 14:29:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:21,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 14:29:21,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:29:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 14:29:21,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:29:21,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305150859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:29:21,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:29:21,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 14:29:21,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444202163] [2024-11-09 14:29:21,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:29:21,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:29:21,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:29:21,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:29:21,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:29:21,643 INFO L87 Difference]: Start difference. First operand has 50 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 43 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:29:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:29:21,663 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2024-11-09 14:29:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:29:21,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-09 14:29:21,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:29:21,670 INFO L225 Difference]: With dead ends: 57 [2024-11-09 14:29:21,670 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 14:29:21,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:29:21,674 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:29:21,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 86 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:29:21,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 14:29:21,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-09 14:29:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 14:29:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2024-11-09 14:29:21,699 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 21 [2024-11-09 14:29:21,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:29:21,699 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2024-11-09 14:29:21,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:29:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2024-11-09 14:29:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 14:29:21,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:29:21,701 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:29:21,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 14:29:21,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-09 14:29:21,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 14:29:21,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:29:21,902 INFO L85 PathProgramCache]: Analyzing trace with hash -448022698, now seen corresponding path program 1 times [2024-11-09 14:29:21,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:29:21,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104166598] [2024-11-09 14:29:21,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:29:21,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:29:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:21,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 14:29:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:21,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 14:29:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:21,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 14:29:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 14:29:22,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:29:22,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104166598] [2024-11-09 14:29:22,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104166598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:29:22,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610509574] [2024-11-09 14:29:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:29:22,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:29:22,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:29:22,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:29:22,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 14:29:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:22,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 14:29:22,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:29:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 14:29:22,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:29:22,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610509574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:29:22,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:29:22,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 14:29:22,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465881802] [2024-11-09 14:29:22,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:29:22,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:29:22,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:29:22,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:29:22,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:29:22,095 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:29:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:29:22,110 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-11-09 14:29:22,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:29:22,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-09 14:29:22,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:29:22,112 INFO L225 Difference]: With dead ends: 49 [2024-11-09 14:29:22,112 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 14:29:22,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:29:22,114 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:29:22,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 76 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:29:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 14:29:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 14:29:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 14:29:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2024-11-09 14:29:22,124 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 22 [2024-11-09 14:29:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:29:22,125 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-09 14:29:22,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:29:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2024-11-09 14:29:22,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 14:29:22,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:29:22,127 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:29:22,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 14:29:22,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-09 14:29:22,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 14:29:22,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:29:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash 10447351, now seen corresponding path program 1 times [2024-11-09 14:29:22,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:29:22,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832606130] [2024-11-09 14:29:22,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:29:22,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:29:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:22,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 14:29:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:22,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 14:29:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:22,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 14:29:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 14:29:22,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:29:22,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832606130] [2024-11-09 14:29:22,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832606130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:29:22,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:29:22,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 14:29:22,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108512921] [2024-11-09 14:29:22,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:29:22,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:29:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:29:22,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:29:22,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:29:22,561 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:29:22,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:29:22,629 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2024-11-09 14:29:22,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:29:22,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-09 14:29:22,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:29:22,630 INFO L225 Difference]: With dead ends: 51 [2024-11-09 14:29:22,630 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 14:29:22,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 14:29:22,631 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 41 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:29:22,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 197 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:29:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 14:29:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-09 14:29:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 14:29:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2024-11-09 14:29:22,640 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 27 [2024-11-09 14:29:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:29:22,640 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-11-09 14:29:22,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:29:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2024-11-09 14:29:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 14:29:22,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:29:22,641 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:29:22,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 14:29:22,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 14:29:22,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:29:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash -344802659, now seen corresponding path program 1 times [2024-11-09 14:29:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:29:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791010067] [2024-11-09 14:29:22,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:29:22,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:29:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:29:22,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 14:29:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:29:22,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 14:29:22,692 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 14:29:22,693 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 14:29:22,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 14:29:22,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 14:29:22,699 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 14:29:22,726 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 14:29:22,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:29:22 BoogieIcfgContainer [2024-11-09 14:29:22,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 14:29:22,728 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 14:29:22,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 14:29:22,729 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 14:29:22,729 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:29:21" (3/4) ... [2024-11-09 14:29:22,731 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 14:29:22,732 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 14:29:22,732 INFO L158 Benchmark]: Toolchain (without parser) took 2780.94ms. Allocated memory was 174.1MB in the beginning and 218.1MB in the end (delta: 44.0MB). Free memory was 92.5MB in the beginning and 142.1MB in the end (delta: -49.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:29:22,732 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:29:22,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 711.24ms. Allocated memory is still 174.1MB. Free memory was 92.5MB in the beginning and 95.5MB in the end (delta: -3.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 14:29:22,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.60ms. Allocated memory is still 174.1MB. Free memory was 95.5MB in the beginning and 92.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 14:29:22,733 INFO L158 Benchmark]: Boogie Preprocessor took 27.04ms. Allocated memory is still 174.1MB. Free memory was 92.4MB in the beginning and 89.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 14:29:22,733 INFO L158 Benchmark]: RCFGBuilder took 345.28ms. Allocated memory is still 174.1MB. Free memory was 89.2MB in the beginning and 125.2MB in the end (delta: -36.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 14:29:22,734 INFO L158 Benchmark]: TraceAbstraction took 1642.76ms. Allocated memory was 174.1MB in the beginning and 218.1MB in the end (delta: 44.0MB). Free memory was 124.2MB in the beginning and 143.1MB in the end (delta: -19.0MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-11-09 14:29:22,734 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 218.1MB. Free memory was 143.1MB in the beginning and 142.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:29:22,735 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 142.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 711.24ms. Allocated memory is still 174.1MB. Free memory was 92.5MB in the beginning and 95.5MB in the end (delta: -3.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.60ms. Allocated memory is still 174.1MB. Free memory was 95.5MB in the beginning and 92.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.04ms. Allocated memory is still 174.1MB. Free memory was 92.4MB in the beginning and 89.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 345.28ms. Allocated memory is still 174.1MB. Free memory was 89.2MB in the beginning and 125.2MB in the end (delta: -36.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1642.76ms. Allocated memory was 174.1MB in the beginning and 218.1MB in the end (delta: 44.0MB). Free memory was 124.2MB in the beginning and 143.1MB in the end (delta: -19.0MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 218.1MB. Free memory was 143.1MB in the beginning and 142.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1567. 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] [L1567] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1567] 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] [L1568] CALL CWE191_Integer_Underflow__int_rand_sub_11_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrue() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) 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] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() 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] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 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] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE globalReturnsTrue() [L1559] data - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1559]: 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 3 procedures, 50 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 359 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 172 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 11/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 14:29:22,757 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/CWE191_Integer_Underflow__int_rand_sub_11_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 2d42bc4029b22d5fbac4ec556f66bb794bd4efb484b2f7343472d3031f33fa34 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 14:29:24,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 14:29:24,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-09 14:29:24,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 14:29:24,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 14:29:24,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-09 14:29:24,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 14:29:24,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 14:29:24,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 14:29:24,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 14:29:24,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 14:29:24,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 14:29:24,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 14:29:24,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 14:29:24,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 14:29:24,542 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 14:29:24,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 14:29:24,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 14:29:24,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 14:29:24,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 14:29:24,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 14:29:24,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 14:29:24,546 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 14:29:24,546 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 14:29:24,546 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 14:29:24,547 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 14:29:24,547 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 14:29:24,547 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 14:29:24,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 14:29:24,547 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 14:29:24,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 14:29:24,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 14:29:24,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 14:29:24,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 14:29:24,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:29:24,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 14:29:24,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 14:29:24,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 14:29:24,549 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 14:29:24,549 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 14:29:24,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 14:29:24,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 14:29:24,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 14:29:24,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 14:29:24,551 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 -> 2d42bc4029b22d5fbac4ec556f66bb794bd4efb484b2f7343472d3031f33fa34 [2024-11-09 14:29:24,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:29:24,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:29:24,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:29:24,824 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:29:24,824 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:29:24,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_bad.i [2024-11-09 14:29:26,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:29:26,311 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:29:26,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_bad.i [2024-11-09 14:29:26,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b374b5281/7acb1124379b467b9d414c937af5325e/FLAG5f7cd1694 [2024-11-09 14:29:26,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b374b5281/7acb1124379b467b9d414c937af5325e [2024-11-09 14:29:26,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:29:26,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:29:26,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:29:26,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:29:26,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:29:26,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:29:26" (1/1) ... [2024-11-09 14:29:26,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28973d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:26, skipping insertion in model container [2024-11-09 14:29:26,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:29:26" (1/1) ... [2024-11-09 14:29:26,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:29:26,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:29:26,985 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:29:27,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:29:27,137 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:29:27,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:27 WrapperNode [2024-11-09 14:29:27,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:29:27,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:29:27,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:29:27,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:29:27,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:27" (1/1) ... [2024-11-09 14:29:27,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:27" (1/1) ... [2024-11-09 14:29:27,186 INFO L138 Inliner]: procedures = 502, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2024-11-09 14:29:27,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:29:27,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:29:27,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:29:27,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:29:27,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:27" (1/1) ... [2024-11-09 14:29:27,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:27" (1/1) ... [2024-11-09 14:29:27,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:27" (1/1) ... [2024-11-09 14:29:27,204 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 14:29:27,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:27" (1/1) ... [2024-11-09 14:29:27,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:27" (1/1) ... [2024-11-09 14:29:27,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:27" (1/1) ... [2024-11-09 14:29:27,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:27" (1/1) ... [2024-11-09 14:29:27,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:27" (1/1) ... [2024-11-09 14:29:27,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:27" (1/1) ... [2024-11-09 14:29:27,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:29:27,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:29:27,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:29:27,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:29:27,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:27" (1/1) ... [2024-11-09 14:29:27,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:29:27,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:29:27,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 14:29:27,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 14:29:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 14:29:27,276 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 14:29:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-11-09 14:29:27,276 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-11-09 14:29:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:29:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:29:27,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:29:27,391 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:29:27,393 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:29:27,519 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-09 14:29:27,519 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:29:27,530 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:29:27,531 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 14:29:27,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:29:27 BoogieIcfgContainer [2024-11-09 14:29:27,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:29:27,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:29:27,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:29:27,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:29:27,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:29:26" (1/3) ... [2024-11-09 14:29:27,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7862c641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:29:27, skipping insertion in model container [2024-11-09 14:29:27,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:29:27" (2/3) ... [2024-11-09 14:29:27,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7862c641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:29:27, skipping insertion in model container [2024-11-09 14:29:27,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:29:27" (3/3) ... [2024-11-09 14:29:27,540 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_sub_11_bad.i [2024-11-09 14:29:27,553 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:29:27,554 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 14:29:27,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:29:27,608 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;@500b5a74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:29:27,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 14:29:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 14:29:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 14:29:27,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:29:27,619 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:29:27,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 14:29:27,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:29:27,623 INFO L85 PathProgramCache]: Analyzing trace with hash -894708504, now seen corresponding path program 1 times [2024-11-09 14:29:27,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:29:27,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639217297] [2024-11-09 14:29:27,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:29:27,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 14:29:27,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:29:27,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 14:29:27,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 14:29:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:29:27,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:29:27,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:29:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:29:27,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:29:27,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:29:27,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639217297] [2024-11-09 14:29:27,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639217297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:29:27,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:29:27,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:29:27,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498879428] [2024-11-09 14:29:27,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:29:27,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:29:27,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:29:27,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:29:27,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:29:27,831 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:29:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:29:27,856 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2024-11-09 14:29:27,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:29:27,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-09 14:29:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:29:27,862 INFO L225 Difference]: With dead ends: 47 [2024-11-09 14:29:27,862 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 14:29:27,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:29:27,866 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:29:27,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:29:27,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 14:29:27,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 14:29:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 14:29:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-09 14:29:27,888 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 19 [2024-11-09 14:29:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:29:27,889 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-09 14:29:27,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:29:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-09 14:29:27,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 14:29:27,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:29:27,891 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:29:27,897 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 (2)] Forceful destruction successful, exit code 0 [2024-11-09 14:29:28,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 14:29:28,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 14:29:28,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:29:28,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2082070403, now seen corresponding path program 1 times [2024-11-09 14:29:28,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:29:28,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239821822] [2024-11-09 14:29:28,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:29:28,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 14:29:28,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:29:28,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 14:29:28,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 14:29:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:29:28,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 14:29:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:29:28,259 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 14:29:28,259 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 14:29:28,260 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 14:29:28,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 14:29:28,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 14:29:28,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 14:29:28,465 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 14:29:28,487 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 14:29:28,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:29:28 BoogieIcfgContainer [2024-11-09 14:29:28,489 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 14:29:28,490 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 14:29:28,490 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 14:29:28,490 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 14:29:28,490 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:29:27" (3/4) ... [2024-11-09 14:29:28,492 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 14:29:28,493 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 14:29:28,493 INFO L158 Benchmark]: Toolchain (without parser) took 2139.37ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 48.1MB in the beginning and 67.6MB in the end (delta: -19.4MB). Peak memory consumption was 942.3kB. Max. memory is 16.1GB. [2024-11-09 14:29:28,494 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 58.7MB. Free memory was 30.4MB in the beginning and 30.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:29:28,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 782.79ms. Allocated memory is still 79.7MB. Free memory was 47.9MB in the beginning and 45.0MB in the end (delta: 2.9MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-11-09 14:29:28,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.48ms. Allocated memory is still 79.7MB. Free memory was 45.0MB in the beginning and 42.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 14:29:28,495 INFO L158 Benchmark]: Boogie Preprocessor took 31.95ms. Allocated memory is still 79.7MB. Free memory was 42.1MB in the beginning and 39.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 14:29:28,495 INFO L158 Benchmark]: RCFGBuilder took 311.55ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 39.2MB in the beginning and 69.9MB in the end (delta: -30.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 14:29:28,495 INFO L158 Benchmark]: TraceAbstraction took 956.90ms. Allocated memory is still 100.7MB. Free memory was 69.3MB in the beginning and 67.6MB in the end (delta: 1.7MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-11-09 14:29:28,496 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 100.7MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:29:28,498 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.68ms. Allocated memory is still 58.7MB. Free memory was 30.4MB in the beginning and 30.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 782.79ms. Allocated memory is still 79.7MB. Free memory was 47.9MB in the beginning and 45.0MB in the end (delta: 2.9MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.48ms. Allocated memory is still 79.7MB. Free memory was 45.0MB in the beginning and 42.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.95ms. Allocated memory is still 79.7MB. Free memory was 42.1MB in the beginning and 39.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 311.55ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 39.2MB in the beginning and 69.9MB in the end (delta: -30.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 956.90ms. Allocated memory is still 100.7MB. Free memory was 69.3MB in the beginning and 67.6MB in the end (delta: 1.7MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 100.7MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1567. 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] [L1567] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1567] 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] [L1568] CALL CWE191_Integer_Underflow__int_rand_sub_11_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrue() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 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] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE globalReturnsTrue() [L1559] data - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1559]: 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 3 procedures, 28 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 2, 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, 85 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 30 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 24 SizeOfPredicates, 0 NumberOfNonLiveVariables, 49 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 14:29:28,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample