./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs5f.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/array-fpi/brs5f.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f54bfe272f098fc8d49d4d1aeeacd60f3c02b9f503aca7cdfa86fa26e25ba9c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:27:48,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:27:48,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:27:48,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:27:48,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:27:48,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:27:48,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:27:48,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:27:48,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:27:48,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:27:48,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:27:48,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:27:48,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:27:48,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:27:48,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:27:48,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:27:48,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:27:48,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:27:48,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:27:48,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:27:48,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:27:48,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:27:48,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:27:48,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:27:48,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:27:48,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:27:48,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:27:48,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:27:48,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:27:48,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:27:48,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:27:48,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:27:48,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:27:48,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:27:48,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:27:48,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:27:48,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:27:48,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:27:48,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:27:48,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:27:48,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:27:48,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:27:48,140 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:27:48,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:27:48,141 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:27:48,141 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:27:48,142 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:27:48,142 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:27:48,142 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:27:48,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:27:48,143 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:27:48,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:27:48,144 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:27:48,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:27:48,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:27:48,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:27:48,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:27:48,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:27:48,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:27:48,145 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:27:48,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:27:48,145 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:27:48,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:27:48,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:27:48,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:27:48,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:27:48,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:27:48,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:27:48,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:27:48,147 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:27:48,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:27:48,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:27:48,148 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:27:48,148 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:27:48,148 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:27:48,148 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f54bfe272f098fc8d49d4d1aeeacd60f3c02b9f503aca7cdfa86fa26e25ba9c [2022-02-20 14:27:48,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:27:48,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:27:48,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:27:48,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:27:48,336 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:27:48,337 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs5f.c [2022-02-20 14:27:48,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f3eaa893/f4b5f28dc57142c5a875def533a1e147/FLAG173d477cd [2022-02-20 14:27:48,742 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:27:48,742 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs5f.c [2022-02-20 14:27:48,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f3eaa893/f4b5f28dc57142c5a875def533a1e147/FLAG173d477cd [2022-02-20 14:27:49,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f3eaa893/f4b5f28dc57142c5a875def533a1e147 [2022-02-20 14:27:49,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:27:49,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:27:49,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:27:49,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:27:49,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:27:49,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:27:49" (1/1) ... [2022-02-20 14:27:49,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bbdcb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:49, skipping insertion in model container [2022-02-20 14:27:49,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:27:49" (1/1) ... [2022-02-20 14:27:49,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:27:49,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:27:49,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs5f.c[588,601] [2022-02-20 14:27:49,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:27:49,335 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:27:49,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs5f.c[588,601] [2022-02-20 14:27:49,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:27:49,359 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:27:49,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:49 WrapperNode [2022-02-20 14:27:49,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:27:49,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:27:49,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:27:49,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:27:49,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:49" (1/1) ... [2022-02-20 14:27:49,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:49" (1/1) ... [2022-02-20 14:27:49,399 INFO L137 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2022-02-20 14:27:49,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:27:49,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:27:49,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:27:49,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:27:49,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:49" (1/1) ... [2022-02-20 14:27:49,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:49" (1/1) ... [2022-02-20 14:27:49,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:49" (1/1) ... [2022-02-20 14:27:49,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:49" (1/1) ... [2022-02-20 14:27:49,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:49" (1/1) ... [2022-02-20 14:27:49,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:49" (1/1) ... [2022-02-20 14:27:49,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:49" (1/1) ... [2022-02-20 14:27:49,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:27:49,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:27:49,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:27:49,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:27:49,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:49" (1/1) ... [2022-02-20 14:27:49,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:27:49,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:27:49,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:27:49,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:27:49,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:27:49,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:27:49,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:27:49,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:27:49,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:27:49,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:27:49,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:27:49,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:27:49,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:27:49,528 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:27:49,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:27:49,682 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:27:49,686 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:27:49,695 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 14:27:49,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:27:49 BoogieIcfgContainer [2022-02-20 14:27:49,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:27:49,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:27:49,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:27:49,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:27:49,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:27:49" (1/3) ... [2022-02-20 14:27:49,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f923d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:27:49, skipping insertion in model container [2022-02-20 14:27:49,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:49" (2/3) ... [2022-02-20 14:27:49,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f923d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:27:49, skipping insertion in model container [2022-02-20 14:27:49,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:27:49" (3/3) ... [2022-02-20 14:27:49,707 INFO L111 eAbstractionObserver]: Analyzing ICFG brs5f.c [2022-02-20 14:27:49,711 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:27:49,711 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:27:49,744 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:27:49,753 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:27:49,754 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:27:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:27:49,771 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:49,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:49,773 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:49,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash 361760665, now seen corresponding path program 1 times [2022-02-20 14:27:49,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:49,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817688002] [2022-02-20 14:27:49,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:49,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:49,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {23#true} is VALID [2022-02-20 14:27:49,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem10#1, main_~i~0#1, main_~#sum~0#1.base, main_~#sum~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {23#true} is VALID [2022-02-20 14:27:49,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {23#true} is VALID [2022-02-20 14:27:49,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {23#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {24#false} is VALID [2022-02-20 14:27:49,963 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#sum~0#1.base, main_~#sum~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~i~0#1 := 0; {24#false} is VALID [2022-02-20 14:27:49,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#false} assume !(main_~i~0#1 < ~N~0); {24#false} is VALID [2022-02-20 14:27:49,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} main_~i~0#1 := 0; {24#false} is VALID [2022-02-20 14:27:49,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume !true; {24#false} is VALID [2022-02-20 14:27:49,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} call main_#t~mem10#1 := read~int(main_~#sum~0#1.base, main_~#sum~0#1.offset, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem10#1 <= 5 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {24#false} is VALID [2022-02-20 14:27:49,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == __VERIFIER_assert_~cond#1; {24#false} is VALID [2022-02-20 14:27:49,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 14:27:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:49,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:49,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817688002] [2022-02-20 14:27:49,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817688002] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:27:49,969 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:27:49,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:27:49,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726445854] [2022-02-20 14:27:49,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:27:49,976 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 14:27:49,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:49,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:50,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:27:50,005 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:50,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:27:50,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:27:50,029 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:50,067 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-02-20 14:27:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:27:50,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 14:27:50,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2022-02-20 14:27:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2022-02-20 14:27:50,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2022-02-20 14:27:50,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:50,151 INFO L225 Difference]: With dead ends: 36 [2022-02-20 14:27:50,153 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 14:27:50,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:27:50,158 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:50,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:27:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 14:27:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 14:27:50,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:50,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,183 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,183 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:50,188 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 14:27:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 14:27:50,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:50,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:50,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 14:27:50,191 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 14:27:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:50,195 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 14:27:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 14:27:50,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:50,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:50,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:50,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-20 14:27:50,199 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2022-02-20 14:27:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:50,199 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-20 14:27:50,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 14:27:50,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:27:50,201 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:50,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:50,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:27:50,204 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:50,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash -447913662, now seen corresponding path program 1 times [2022-02-20 14:27:50,207 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:50,207 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906286755] [2022-02-20 14:27:50,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:50,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {119#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {119#true} is VALID [2022-02-20 14:27:50,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem10#1, main_~i~0#1, main_~#sum~0#1.base, main_~#sum~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {119#true} is VALID [2022-02-20 14:27:50,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {119#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {121#(<= 1 ~N~0)} is VALID [2022-02-20 14:27:50,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {121#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {121#(<= 1 ~N~0)} is VALID [2022-02-20 14:27:50,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {121#(<= 1 ~N~0)} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#sum~0#1.base, main_~#sum~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~i~0#1 := 0; {122#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0))} is VALID [2022-02-20 14:27:50,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {122#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0))} assume !(main_~i~0#1 < ~N~0); {120#false} is VALID [2022-02-20 14:27:50,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {120#false} main_~i~0#1 := 0; {120#false} is VALID [2022-02-20 14:27:50,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {120#false} assume !(main_~i~0#1 < ~N~0); {120#false} is VALID [2022-02-20 14:27:50,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {120#false} call main_#t~mem10#1 := read~int(main_~#sum~0#1.base, main_~#sum~0#1.offset, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem10#1 <= 5 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {120#false} is VALID [2022-02-20 14:27:50,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {120#false} assume 0 == __VERIFIER_assert_~cond#1; {120#false} is VALID [2022-02-20 14:27:50,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {120#false} assume !false; {120#false} is VALID [2022-02-20 14:27:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:50,289 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:50,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906286755] [2022-02-20 14:27:50,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906286755] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:27:50,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:27:50,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:27:50,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538527021] [2022-02-20 14:27:50,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:27:50,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 14:27:50,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:50,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:50,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:27:50,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:50,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:27:50,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:27:50,300 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:50,358 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-20 14:27:50,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:27:50,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 14:27:50,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-02-20 14:27:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-02-20 14:27:50,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2022-02-20 14:27:50,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:50,392 INFO L225 Difference]: With dead ends: 33 [2022-02-20 14:27:50,392 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 14:27:50,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:27:50,393 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:50,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 12 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:27:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 14:27:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-02-20 14:27:50,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:50,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,398 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,398 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:50,399 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 14:27:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 14:27:50,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:50,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:50,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 14:27:50,400 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 14:27:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:50,401 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 14:27:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 14:27:50,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:50,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:50,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:50,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-02-20 14:27:50,403 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2022-02-20 14:27:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:50,403 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-20 14:27:50,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 14:27:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:27:50,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:50,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:50,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:27:50,404 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:50,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:50,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1044113915, now seen corresponding path program 1 times [2022-02-20 14:27:50,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:50,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180806554] [2022-02-20 14:27:50,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:50,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 14:27:50,435 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 14:27:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 14:27:50,474 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 14:27:50,475 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 14:27:50,475 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:27:50,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:27:50,479 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 14:27:50,481 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:27:50,503 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:27:50,503 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:27:50,503 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 14:27:50,503 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 14:27:50,503 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 14:27:50,504 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:27:50,504 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:27:50,504 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:27:50,504 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 14:27:50,504 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-02-20 14:27:50,504 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-02-20 14:27:50,504 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-02-20 14:27:50,504 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2022-02-20 14:27:50,504 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 14:27:50,504 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 14:27:50,504 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-02-20 14:27:50,505 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-02-20 14:27:50,505 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-02-20 14:27:50,505 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-02-20 14:27:50,505 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2022-02-20 14:27:50,505 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 14:27:50,505 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 14:27:50,505 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 14:27:50,505 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 14:27:50,505 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 14:27:50,505 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 14:27:50,505 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 14:27:50,505 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2022-02-20 14:27:50,505 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 14:27:50,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:27:50 BoogieIcfgContainer [2022-02-20 14:27:50,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:27:50,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:27:50,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:27:50,506 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:27:50,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:27:49" (3/4) ... [2022-02-20 14:27:50,508 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 14:27:50,558 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:27:50,559 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:27:50,560 INFO L158 Benchmark]: Toolchain (without parser) took 1385.12ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 55.9MB in the beginning and 64.7MB in the end (delta: -8.9MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-02-20 14:27:50,560 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 24.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:27:50,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.86ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 55.7MB in the beginning and 87.7MB in the end (delta: -32.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-02-20 14:27:50,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.67ms. Allocated memory is still 113.2MB. Free memory was 87.7MB in the beginning and 86.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:27:50,561 INFO L158 Benchmark]: Boogie Preprocessor took 26.33ms. Allocated memory is still 113.2MB. Free memory was 86.1MB in the beginning and 85.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:27:50,561 INFO L158 Benchmark]: RCFGBuilder took 269.10ms. Allocated memory is still 113.2MB. Free memory was 84.7MB in the beginning and 72.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 14:27:50,561 INFO L158 Benchmark]: TraceAbstraction took 807.72ms. Allocated memory is still 113.2MB. Free memory was 72.1MB in the beginning and 67.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2022-02-20 14:27:50,562 INFO L158 Benchmark]: Witness Printer took 52.37ms. Allocated memory is still 113.2MB. Free memory was 67.5MB in the beginning and 64.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 14:27:50,563 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 24.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.86ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 55.7MB in the beginning and 87.7MB in the end (delta: -32.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.67ms. Allocated memory is still 113.2MB. Free memory was 87.7MB in the beginning and 86.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.33ms. Allocated memory is still 113.2MB. Free memory was 86.1MB in the beginning and 85.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 269.10ms. Allocated memory is still 113.2MB. Free memory was 84.7MB in the beginning and 72.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 807.72ms. Allocated memory is still 113.2MB. Free memory was 72.1MB in the beginning and 67.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Witness Printer took 52.37ms. Allocated memory is still 113.2MB. Free memory was 67.5MB in the beginning and 64.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; VAL [N=0] [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, N=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] long long sum[1]; [L29] int *a = malloc(sizeof(int)*N); [L31] i=0 VAL [a={-1:0}, i=0, N=1, sum={7:0}] [L31] COND TRUE i