./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_11_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f 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_predec_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 dbe2ca349e0667d8692126dce502d970e06290e62c46f46043e6bad80040db74 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 21:48:18,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 21:48:18,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-10 21:48:18,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 21:48:18,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 21:48:18,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 21:48:18,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 21:48:18,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 21:48:18,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 21:48:18,845 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 21:48:18,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 21:48:18,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 21:48:18,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 21:48:18,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 21:48:18,848 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 21:48:18,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 21:48:18,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 21:48:18,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 21:48:18,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 21:48:18,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 21:48:18,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 21:48:18,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 21:48:18,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 21:48:18,857 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 21:48:18,857 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 21:48:18,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 21:48:18,858 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 21:48:18,858 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 21:48:18,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 21:48:18,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 21:48:18,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 21:48:18,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:48:18,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 21:48:18,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 21:48:18,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 21:48:18,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 21:48:18,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 21:48:18,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 21:48:18,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 21:48:18,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 21:48:18,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 21:48:18,862 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 -> dbe2ca349e0667d8692126dce502d970e06290e62c46f46043e6bad80040db74 [2024-11-10 21:48:19,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 21:48:19,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 21:48:19,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 21:48:19,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 21:48:19,131 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 21:48:19,132 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_predec_11_bad.i [2024-11-10 21:48:20,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 21:48:20,995 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 21:48:20,995 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_11_bad.i [2024-11-10 21:48:21,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba13c3a45/5d99a143fff94613868bf79ccf32dc75/FLAGd3fb0ca16 [2024-11-10 21:48:21,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba13c3a45/5d99a143fff94613868bf79ccf32dc75 [2024-11-10 21:48:21,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 21:48:21,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 21:48:21,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 21:48:21,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 21:48:21,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 21:48:21,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:48:21" (1/1) ... [2024-11-10 21:48:21,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c3e692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:21, skipping insertion in model container [2024-11-10 21:48:21,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:48:21" (1/1) ... [2024-11-10 21:48:21,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 21:48:21,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:48:21,852 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 21:48:21,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:48:22,143 INFO L204 MainTranslator]: Completed translation [2024-11-10 21:48:22,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:22 WrapperNode [2024-11-10 21:48:22,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 21:48:22,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 21:48:22,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 21:48:22,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 21:48:22,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:22" (1/1) ... [2024-11-10 21:48:22,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:22" (1/1) ... [2024-11-10 21:48:22,204 INFO L138 Inliner]: procedures = 497, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 109 [2024-11-10 21:48:22,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 21:48:22,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 21:48:22,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 21:48:22,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 21:48:22,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:22" (1/1) ... [2024-11-10 21:48:22,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:22" (1/1) ... [2024-11-10 21:48:22,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:22" (1/1) ... [2024-11-10 21:48:22,231 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 21:48:22,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:22" (1/1) ... [2024-11-10 21:48:22,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:22" (1/1) ... [2024-11-10 21:48:22,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:22" (1/1) ... [2024-11-10 21:48:22,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:22" (1/1) ... [2024-11-10 21:48:22,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:22" (1/1) ... [2024-11-10 21:48:22,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:22" (1/1) ... [2024-11-10 21:48:22,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 21:48:22,243 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 21:48:22,243 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 21:48:22,243 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 21:48:22,244 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:22" (1/1) ... [2024-11-10 21:48:22,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:48:22,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:48:22,289 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-10 21:48:22,295 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-10 21:48:22,339 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 21:48:22,339 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 21:48:22,339 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-11-10 21:48:22,339 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-11-10 21:48:22,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 21:48:22,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 21:48:22,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 21:48:22,516 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 21:48:22,518 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 21:48:22,735 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-10 21:48:22,735 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 21:48:22,761 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 21:48:22,764 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 21:48:22,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:48:22 BoogieIcfgContainer [2024-11-10 21:48:22,764 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 21:48:22,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 21:48:22,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 21:48:22,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 21:48:22,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:48:21" (1/3) ... [2024-11-10 21:48:22,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487f8009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:48:22, skipping insertion in model container [2024-11-10 21:48:22,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:22" (2/3) ... [2024-11-10 21:48:22,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487f8009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:48:22, skipping insertion in model container [2024-11-10 21:48:22,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:48:22" (3/3) ... [2024-11-10 21:48:22,776 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_11_bad.i [2024-11-10 21:48:22,794 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 21:48:22,794 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 21:48:22,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 21:48:22,878 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;@732be003, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 21:48:22,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 21:48:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 44 states have internal predecessors, (60), 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-10 21:48:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 21:48:22,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:48:22,893 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-10 21:48:22,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:48:22,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:48:22,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1967329573, now seen corresponding path program 1 times [2024-11-10 21:48:22,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:48:22,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935000661] [2024-11-10 21:48:22,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:48:22,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:48:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:23,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 21:48:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:23,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 21:48:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:23,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 21:48:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:23,380 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-10 21:48:23,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:48:23,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935000661] [2024-11-10 21:48:23,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935000661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:48:23,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220581622] [2024-11-10 21:48:23,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:48:23,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:48:23,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:48:23,386 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-10 21:48:23,388 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-10 21:48:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:23,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 21:48:23,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:48:23,534 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-10 21:48:23,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:48:23,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220581622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:48:23,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:48:23,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-10 21:48:23,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521892149] [2024-11-10 21:48:23,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:48:23,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:48:23,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:48:23,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:48:23,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:48:23,563 INFO L87 Difference]: Start difference. First operand has 51 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 44 states have internal predecessors, (60), 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-10 21:48:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:48:23,621 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2024-11-10 21:48:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:48:23,626 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-10 21:48:23,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:48:23,633 INFO L225 Difference]: With dead ends: 59 [2024-11-10 21:48:23,634 INFO L226 Difference]: Without dead ends: 48 [2024-11-10 21:48:23,636 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-10 21:48:23,639 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:48:23,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 82 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:48:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-10 21:48:23,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-10 21:48:23,672 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-10 21:48:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2024-11-10 21:48:23,675 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 21 [2024-11-10 21:48:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:48:23,676 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2024-11-10 21:48:23,676 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-10 21:48:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2024-11-10 21:48:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 21:48:23,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:48:23,677 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-10 21:48:23,690 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-10 21:48:23,878 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-10 21:48:23,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:48:23,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:48:23,879 INFO L85 PathProgramCache]: Analyzing trace with hash 857674600, now seen corresponding path program 1 times [2024-11-10 21:48:23,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:48:23,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616138861] [2024-11-10 21:48:23,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:48:23,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:48:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:23,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 21:48:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:23,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 21:48:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:23,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 21:48:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:23,997 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-10 21:48:23,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:48:23,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616138861] [2024-11-10 21:48:24,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616138861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:48:24,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604240395] [2024-11-10 21:48:24,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:48:24,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:48:24,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:48:24,003 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-10 21:48:24,004 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-10 21:48:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:24,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 21:48:24,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:48:24,130 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-10 21:48:24,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:48:24,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604240395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:48:24,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:48:24,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-10 21:48:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137758406] [2024-11-10 21:48:24,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:48:24,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:48:24,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:48:24,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:48:24,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:48:24,135 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-10 21:48:24,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:48:24,159 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-11-10 21:48:24,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:48:24,160 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-10 21:48:24,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:48:24,161 INFO L225 Difference]: With dead ends: 49 [2024-11-10 21:48:24,162 INFO L226 Difference]: Without dead ends: 43 [2024-11-10 21:48:24,162 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-10 21:48:24,165 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 68 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-10 21:48:24,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:48:24,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-10 21:48:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-10 21:48:24,171 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-10 21:48:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2024-11-10 21:48:24,172 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 22 [2024-11-10 21:48:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:48:24,173 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-10 21:48:24,173 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-10 21:48:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2024-11-10 21:48:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 21:48:24,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:48:24,174 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-10 21:48:24,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 21:48:24,378 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-10 21:48:24,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:48:24,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:48:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1457867753, now seen corresponding path program 1 times [2024-11-10 21:48:24,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:48:24,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183340769] [2024-11-10 21:48:24,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:48:24,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:48:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:24,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 21:48:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:24,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 21:48:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:24,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 21:48:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:24,685 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-10 21:48:24,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:48:24,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183340769] [2024-11-10 21:48:24,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183340769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:48:24,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:48:24,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 21:48:24,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074384528] [2024-11-10 21:48:24,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:48:24,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 21:48:24,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:48:24,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 21:48:24,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 21:48:24,689 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-10 21:48:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:48:24,795 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2024-11-10 21:48:24,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:48:24,796 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-10 21:48:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:48:24,797 INFO L225 Difference]: With dead ends: 51 [2024-11-10 21:48:24,797 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 21:48:24,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 21:48:24,798 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 41 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:48:24,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 185 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:48:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 21:48:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-10 21:48:24,807 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-10 21:48:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2024-11-10 21:48:24,808 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 27 [2024-11-10 21:48:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:48:24,809 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-11-10 21:48:24,809 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-10 21:48:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2024-11-10 21:48:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 21:48:24,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:48:24,810 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-10 21:48:24,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 21:48:24,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:48:24,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:48:24,811 INFO L85 PathProgramCache]: Analyzing trace with hash 511990890, now seen corresponding path program 1 times [2024-11-10 21:48:24,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:48:24,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874135626] [2024-11-10 21:48:24,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:48:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:48:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 21:48:24,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 21:48:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 21:48:24,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 21:48:24,881 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 21:48:24,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-10 21:48:24,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-10 21:48:24,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 21:48:24,892 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 21:48:24,923 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 21:48:24,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:48:24 BoogieIcfgContainer [2024-11-10 21:48:24,927 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 21:48:24,928 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 21:48:24,928 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 21:48:24,928 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 21:48:24,929 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:48:22" (3/4) ... [2024-11-10 21:48:24,931 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 21:48:24,933 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 21:48:24,935 INFO L158 Benchmark]: Toolchain (without parser) took 3888.03ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 101.2MB in the beginning and 144.4MB in the end (delta: -43.2MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-11-10 21:48:24,935 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory was 119.7MB in the beginning and 119.6MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:48:24,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1095.75ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 100.8MB in the beginning and 157.2MB in the end (delta: -56.4MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2024-11-10 21:48:24,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.59ms. Allocated memory is still 216.0MB. Free memory was 157.2MB in the beginning and 154.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 21:48:24,936 INFO L158 Benchmark]: Boogie Preprocessor took 36.83ms. Allocated memory is still 216.0MB. Free memory was 154.1MB in the beginning and 153.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 21:48:24,937 INFO L158 Benchmark]: IcfgBuilder took 521.73ms. Allocated memory is still 216.0MB. Free memory was 152.0MB in the beginning and 134.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 21:48:24,937 INFO L158 Benchmark]: TraceAbstraction took 2159.76ms. Allocated memory is still 216.0MB. Free memory was 133.1MB in the beginning and 145.5MB in the end (delta: -12.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:48:24,937 INFO L158 Benchmark]: Witness Printer took 5.36ms. Allocated memory is still 216.0MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:48:24,938 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.11ms. Allocated memory is still 159.4MB. Free memory was 119.7MB in the beginning and 119.6MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1095.75ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 100.8MB in the beginning and 157.2MB in the end (delta: -56.4MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.59ms. Allocated memory is still 216.0MB. Free memory was 157.2MB in the beginning and 154.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.83ms. Allocated memory is still 216.0MB. Free memory was 154.1MB in the beginning and 153.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 521.73ms. Allocated memory is still 216.0MB. Free memory was 152.0MB in the beginning and 134.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2159.76ms. Allocated memory is still 216.0MB. Free memory was 133.1MB in the beginning and 145.5MB in the end (delta: -12.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.36ms. Allocated memory is still 216.0MB. Free memory is still 144.4MB. 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 1568. 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] [L1568] 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) [L1568] 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] [L1569] CALL CWE191_Integer_Underflow__int_rand_predec_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 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, 51 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 335 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 157 mSDtfsCounter, 80 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=51occurred 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.8s 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-10 21:48:24,966 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_predec_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 dbe2ca349e0667d8692126dce502d970e06290e62c46f46043e6bad80040db74 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 21:48:27,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 21:48:27,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-10 21:48:27,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 21:48:27,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 21:48:27,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-10 21:48:27,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 21:48:27,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 21:48:27,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 21:48:27,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 21:48:27,386 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 21:48:27,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 21:48:27,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 21:48:27,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 21:48:27,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 21:48:27,388 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 21:48:27,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 21:48:27,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 21:48:27,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 21:48:27,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 21:48:27,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 21:48:27,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 21:48:27,395 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 21:48:27,395 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 21:48:27,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 21:48:27,395 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 21:48:27,396 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 21:48:27,396 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 21:48:27,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 21:48:27,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 21:48:27,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 21:48:27,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 21:48:27,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 21:48:27,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 21:48:27,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:48:27,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 21:48:27,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 21:48:27,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 21:48:27,401 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 21:48:27,401 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 21:48:27,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 21:48:27,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 21:48:27,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 21:48:27,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 21:48:27,402 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 -> dbe2ca349e0667d8692126dce502d970e06290e62c46f46043e6bad80040db74 [2024-11-10 21:48:27,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 21:48:27,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 21:48:27,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 21:48:27,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 21:48:27,763 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 21:48:27,764 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_predec_11_bad.i [2024-11-10 21:48:29,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 21:48:29,630 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 21:48:29,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_11_bad.i [2024-11-10 21:48:29,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c42b1ab8e/a3d57c9b479e4c9b870ccd4e36070ce1/FLAG2d4acef8c [2024-11-10 21:48:29,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c42b1ab8e/a3d57c9b479e4c9b870ccd4e36070ce1 [2024-11-10 21:48:29,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 21:48:29,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 21:48:29,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 21:48:29,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 21:48:29,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 21:48:29,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:48:29" (1/1) ... [2024-11-10 21:48:29,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54563d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:29, skipping insertion in model container [2024-11-10 21:48:29,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:48:29" (1/1) ... [2024-11-10 21:48:29,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 21:48:30,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:48:30,791 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 21:48:30,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:48:30,998 INFO L204 MainTranslator]: Completed translation [2024-11-10 21:48:30,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:30 WrapperNode [2024-11-10 21:48:31,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 21:48:31,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 21:48:31,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 21:48:31,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 21:48:31,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:30" (1/1) ... [2024-11-10 21:48:31,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:30" (1/1) ... [2024-11-10 21:48:31,064 INFO L138 Inliner]: procedures = 502, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2024-11-10 21:48:31,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 21:48:31,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 21:48:31,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 21:48:31,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 21:48:31,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:30" (1/1) ... [2024-11-10 21:48:31,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:30" (1/1) ... [2024-11-10 21:48:31,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:30" (1/1) ... [2024-11-10 21:48:31,097 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 21:48:31,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:30" (1/1) ... [2024-11-10 21:48:31,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:30" (1/1) ... [2024-11-10 21:48:31,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:30" (1/1) ... [2024-11-10 21:48:31,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:30" (1/1) ... [2024-11-10 21:48:31,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:30" (1/1) ... [2024-11-10 21:48:31,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:30" (1/1) ... [2024-11-10 21:48:31,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 21:48:31,130 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 21:48:31,132 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 21:48:31,133 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 21:48:31,133 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:30" (1/1) ... [2024-11-10 21:48:31,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:48:31,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:48:31,164 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-10 21:48:31,170 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-10 21:48:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 21:48:31,206 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 21:48:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-11-10 21:48:31,207 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-11-10 21:48:31,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 21:48:31,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 21:48:31,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 21:48:31,356 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 21:48:31,361 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 21:48:31,505 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-10 21:48:31,505 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 21:48:31,515 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 21:48:31,515 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 21:48:31,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:48:31 BoogieIcfgContainer [2024-11-10 21:48:31,516 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 21:48:31,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 21:48:31,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 21:48:31,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 21:48:31,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:48:29" (1/3) ... [2024-11-10 21:48:31,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fb837f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:48:31, skipping insertion in model container [2024-11-10 21:48:31,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:48:30" (2/3) ... [2024-11-10 21:48:31,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fb837f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:48:31, skipping insertion in model container [2024-11-10 21:48:31,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:48:31" (3/3) ... [2024-11-10 21:48:31,523 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_11_bad.i [2024-11-10 21:48:31,539 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 21:48:31,539 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 21:48:31,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 21:48:31,597 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;@27211f6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 21:48:31,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 21:48:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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-10 21:48:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 21:48:31,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:48:31,610 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:48:31,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:48:31,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:48:31,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1982519197, now seen corresponding path program 1 times [2024-11-10 21:48:31,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:48:31,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287633283] [2024-11-10 21:48:31,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:48:31,631 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-10 21:48:31,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:48:31,634 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-10 21:48:31,636 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-10 21:48:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:48:31,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 21:48:31,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:48:31,827 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-10 21:48:31,827 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:48:31,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:48:31,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287633283] [2024-11-10 21:48:31,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287633283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:48:31,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:48:31,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:48:31,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77050899] [2024-11-10 21:48:31,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:48:31,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:48:31,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:48:31,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:48:31,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:48:31,858 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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-10 21:48:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:48:31,888 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2024-11-10 21:48:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:48:31,891 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-10 21:48:31,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:48:31,895 INFO L225 Difference]: With dead ends: 49 [2024-11-10 21:48:31,896 INFO L226 Difference]: Without dead ends: 19 [2024-11-10 21:48:31,898 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-10 21:48:31,901 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 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-10 21:48:31,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:48:31,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-10 21:48:31,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-10 21:48:31,932 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-10 21:48:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-10 21:48:31,934 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 19 [2024-11-10 21:48:31,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:48:31,935 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-10 21:48:31,936 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-10 21:48:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-10 21:48:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 21:48:31,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:48:31,937 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-10 21:48:31,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 21:48:32,139 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-10 21:48:32,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:48:32,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:48:32,141 INFO L85 PathProgramCache]: Analyzing trace with hash -443392127, now seen corresponding path program 1 times [2024-11-10 21:48:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:48:32,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454041008] [2024-11-10 21:48:32,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:48:32,142 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-10 21:48:32,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:48:32,143 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-10 21:48:32,144 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-10 21:48:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 21:48:32,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 21:48:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 21:48:32,296 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 21:48:32,297 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 21:48:32,298 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-10 21:48:32,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-10 21:48:32,306 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-10 21:48:32,501 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-10 21:48:32,505 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 21:48:32,544 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 21:48:32,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:48:32 BoogieIcfgContainer [2024-11-10 21:48:32,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 21:48:32,554 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 21:48:32,554 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 21:48:32,554 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 21:48:32,555 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:48:31" (3/4) ... [2024-11-10 21:48:32,578 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 21:48:32,579 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 21:48:32,584 INFO L158 Benchmark]: Toolchain (without parser) took 2708.73ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 45.1MB in the beginning and 51.0MB in the end (delta: -5.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-11-10 21:48:32,584 INFO L158 Benchmark]: CDTParser took 1.63ms. Allocated memory is still 54.5MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 63.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:48:32,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1125.36ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 44.8MB in the beginning and 50.3MB in the end (delta: -5.5MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-11-10 21:48:32,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.65ms. Allocated memory is still 81.8MB. Free memory was 50.3MB in the beginning and 46.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 21:48:32,585 INFO L158 Benchmark]: Boogie Preprocessor took 63.43ms. Allocated memory is still 81.8MB. Free memory was 46.9MB in the beginning and 44.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 21:48:32,586 INFO L158 Benchmark]: IcfgBuilder took 385.85ms. Allocated memory is still 81.8MB. Free memory was 44.4MB in the beginning and 51.4MB in the end (delta: -7.0MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-11-10 21:48:32,586 INFO L158 Benchmark]: TraceAbstraction took 1035.10ms. Allocated memory is still 81.8MB. Free memory was 50.4MB in the beginning and 51.5MB in the end (delta: -1.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-10 21:48:32,587 INFO L158 Benchmark]: Witness Printer took 24.82ms. Allocated memory is still 81.8MB. Free memory was 51.0MB in the beginning and 51.0MB in the end (delta: 45.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 21:48:32,595 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.63ms. Allocated memory is still 54.5MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 63.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1125.36ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 44.8MB in the beginning and 50.3MB in the end (delta: -5.5MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.65ms. Allocated memory is still 81.8MB. Free memory was 50.3MB in the beginning and 46.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.43ms. Allocated memory is still 81.8MB. Free memory was 46.9MB in the beginning and 44.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 385.85ms. Allocated memory is still 81.8MB. Free memory was 44.4MB in the beginning and 51.4MB in the end (delta: -7.0MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1035.10ms. Allocated memory is still 81.8MB. Free memory was 50.4MB in the beginning and 51.5MB in the end (delta: -1.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Witness Printer took 24.82ms. Allocated memory is still 81.8MB. Free memory was 51.0MB in the beginning and 51.0MB in the end (delta: 45.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 1568. 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] [L1568] 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) [L1568] 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] [L1569] CALL CWE191_Integer_Underflow__int_rand_predec_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 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, 29 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, 88 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 31 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=29occurred 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.1s 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-10 21:48:32,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample