./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_-write.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_-write.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db4b4fb03b1dcc2b831885b6cb4b7f01d511832c58de7e20715e49b64db06c6b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:49:02,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:49:02,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:49:02,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:49:02,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:49:02,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:49:02,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:49:02,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:49:02,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:49:02,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:49:02,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:49:02,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:49:02,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:49:02,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:49:02,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:49:02,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:49:02,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:49:02,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:49:02,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:49:02,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:49:02,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:49:02,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:49:02,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:49:02,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:49:02,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:49:02,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:49:02,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:49:02,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:49:02,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:49:02,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:49:02,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:49:02,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:49:02,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:49:02,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:49:02,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:49:02,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:49:02,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:49:02,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:49:02,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:49:02,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:49:02,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:49:02,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:49:02,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:49:02,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:49:02,473 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:49:02,474 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:49:02,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:49:02,475 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:49:02,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:49:02,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:49:02,476 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:49:02,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:49:02,477 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:49:02,477 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:49:02,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:49:02,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:49:02,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:49:02,478 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:49:02,478 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:49:02,478 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:49:02,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:49:02,478 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:49:02,479 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:49:02,479 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:49:02,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:49:02,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:49:02,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:49:02,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:02,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:49:02,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:49:02,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:49:02,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:49:02,481 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> db4b4fb03b1dcc2b831885b6cb4b7f01d511832c58de7e20715e49b64db06c6b [2022-02-20 23:49:02,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:49:02,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:49:02,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:49:02,716 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:49:02,717 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:49:02,718 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_-write.c [2022-02-20 23:49:02,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3120841fb/b57e61dae195498c971b7be8c0782814/FLAGb2be811d7 [2022-02-20 23:49:03,087 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:49:03,087 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_-write.c [2022-02-20 23:49:03,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3120841fb/b57e61dae195498c971b7be8c0782814/FLAGb2be811d7 [2022-02-20 23:49:03,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3120841fb/b57e61dae195498c971b7be8c0782814 [2022-02-20 23:49:03,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:49:03,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:49:03,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:03,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:49:03,536 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:49:03,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:03" (1/1) ... [2022-02-20 23:49:03,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70722b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:03, skipping insertion in model container [2022-02-20 23:49:03,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:03" (1/1) ... [2022-02-20 23:49:03,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:49:03,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:03,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:03,724 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:49:03,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:03,769 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:49:03,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:03 WrapperNode [2022-02-20 23:49:03,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:03,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:49:03,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:49:03,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:49:03,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:03" (1/1) ... [2022-02-20 23:49:03,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:03" (1/1) ... [2022-02-20 23:49:03,808 INFO L137 Inliner]: procedures = 9, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2022-02-20 23:49:03,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:49:03,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:49:03,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:49:03,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:49:03,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:03" (1/1) ... [2022-02-20 23:49:03,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:03" (1/1) ... [2022-02-20 23:49:03,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:03" (1/1) ... [2022-02-20 23:49:03,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:03" (1/1) ... [2022-02-20 23:49:03,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:03" (1/1) ... [2022-02-20 23:49:03,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:03" (1/1) ... [2022-02-20 23:49:03,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:03" (1/1) ... [2022-02-20 23:49:03,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:49:03,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:49:03,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:49:03,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:49:03,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:03" (1/1) ... [2022-02-20 23:49:03,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:03,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:03,876 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 23:49:03,898 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 23:49:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:49:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:49:03,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:49:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:49:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:49:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:49:03,968 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:49:03,969 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:49:04,176 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:49:04,182 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:49:04,182 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:49:04,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:04 BoogieIcfgContainer [2022-02-20 23:49:04,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:49:04,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:49:04,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:49:04,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:49:04,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:49:03" (1/3) ... [2022-02-20 23:49:04,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7348b414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:49:04, skipping insertion in model container [2022-02-20 23:49:04,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:03" (2/3) ... [2022-02-20 23:49:04,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7348b414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:49:04, skipping insertion in model container [2022-02-20 23:49:04,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:04" (3/3) ... [2022-02-20 23:49:04,202 INFO L111 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_-write.c [2022-02-20 23:49:04,210 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:49:04,210 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-02-20 23:49:04,291 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:49:04,297 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 23:49:04,298 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-02-20 23:49:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.75) internal successors, (49), 39 states have internal predecessors, (49), 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 23:49:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:49:04,317 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:04,317 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:49:04,317 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2022-02-20 23:49:04,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:04,322 INFO L85 PathProgramCache]: Analyzing trace with hash 28698921, now seen corresponding path program 1 times [2022-02-20 23:49:04,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:04,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235640880] [2022-02-20 23:49:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:04,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {43#true} is VALID [2022-02-20 23:49:04,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret6#1, main_#t~post5#1, main_#t~mem7#1, main_~i~2#1, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~2#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);main_~i~2#1 := 0; {45#(= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1)} is VALID [2022-02-20 23:49:04,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#(= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1)} assume !!(main_~i~2#1 < 100);assume { :begin_inline_foo } true;foo_#in~n#1, foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~i~2#1, main_~#b~0#1.base, main_~#b~0#1.offset, 1 + main_~i~2#1;havoc foo_#res#1;havoc foo_#t~mem3#1, foo_#t~post2#1, foo_#t~ret4#1, foo_~n#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~#a~0#1.base, foo_~#a~0#1.offset, foo_~i~1#1;foo_~n#1 := foo_#in~n#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;call foo_~#a~0#1.base, foo_~#a~0#1.offset := #Ultimate.allocOnStack(4 * foo_~n#1);havoc foo_~i~1#1;foo_~i~1#1 := 0; {46#(= (select |#valid| |ULTIMATE.start_foo_~b#1.base|) 1)} is VALID [2022-02-20 23:49:04,581 INFO L290 TraceCheckUtils]: 3: Hoare triple {46#(= (select |#valid| |ULTIMATE.start_foo_~b#1.base|) 1)} assume !!(foo_~i~1#1 < foo_~size#1); {46#(= (select |#valid| |ULTIMATE.start_foo_~b#1.base|) 1)} is VALID [2022-02-20 23:49:04,582 INFO L290 TraceCheckUtils]: 4: Hoare triple {46#(= (select |#valid| |ULTIMATE.start_foo_~b#1.base|) 1)} assume !(1 == #valid[foo_~b#1.base]); {44#false} is VALID [2022-02-20 23:49:04,583 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 23:49:04,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:04,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235640880] [2022-02-20 23:49:04,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235640880] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:04,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:04,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:49:04,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91767466] [2022-02-20 23:49:04,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:04,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2022-02-20 23:49:04,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:04,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 23:49:04,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:04,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:49:04,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:04,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:49:04,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:49:04,635 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.75) internal successors, (49), 39 states have internal predecessors, (49), 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 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 23:49:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:04,853 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-02-20 23:49:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:49:04,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2022-02-20 23:49:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 23:49:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-02-20 23:49:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 23:49:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-02-20 23:49:04,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2022-02-20 23:49:04,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:04,945 INFO L225 Difference]: With dead ends: 38 [2022-02-20 23:49:04,945 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 23:49:04,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:04,952 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 47 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:04,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 43 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 23:49:04,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 23:49:04,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:04,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 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 23:49:04,976 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 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 23:49:04,977 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 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 23:49:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:04,979 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-20 23:49:04,979 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-20 23:49:04,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:04,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:04,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 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 36 states. [2022-02-20 23:49:04,981 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 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 36 states. [2022-02-20 23:49:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:04,983 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-20 23:49:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-20 23:49:04,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:04,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:04,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:04,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 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 23:49:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-02-20 23:49:04,988 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 5 [2022-02-20 23:49:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:04,988 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-02-20 23:49:04,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 23:49:04,989 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-20 23:49:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:49:04,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:04,989 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:49:04,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:49:04,990 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2022-02-20 23:49:04,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash 28698922, now seen corresponding path program 1 times [2022-02-20 23:49:04,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:04,991 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814688726] [2022-02-20 23:49:04,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:04,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:05,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {197#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {197#true} is VALID [2022-02-20 23:49:05,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret6#1, main_#t~post5#1, main_#t~mem7#1, main_~i~2#1, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~2#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);main_~i~2#1 := 0; {199#(and (not (= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 400 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:05,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {199#(and (not (= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 400 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~2#1 < 100);assume { :begin_inline_foo } true;foo_#in~n#1, foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~i~2#1, main_~#b~0#1.base, main_~#b~0#1.offset, 1 + main_~i~2#1;havoc foo_#res#1;havoc foo_#t~mem3#1, foo_#t~post2#1, foo_#t~ret4#1, foo_~n#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~#a~0#1.base, foo_~#a~0#1.offset, foo_~i~1#1;foo_~n#1 := foo_#in~n#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;call foo_~#a~0#1.base, foo_~#a~0#1.offset := #Ultimate.allocOnStack(4 * foo_~n#1);havoc foo_~i~1#1;foo_~i~1#1 := 0; {200#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~1#1| 0) (<= 400 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:05,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {200#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~1#1| 0) (<= 400 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !!(foo_~i~1#1 < foo_~size#1); {200#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~1#1| 0) (<= 400 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:05,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {200#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~1#1| 0) (<= 400 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !(4 + (foo_~b#1.offset + 4 * foo_~i~1#1) <= #length[foo_~b#1.base] && 0 <= foo_~b#1.offset + 4 * foo_~i~1#1); {198#false} is VALID [2022-02-20 23:49:05,069 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 23:49:05,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:05,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814688726] [2022-02-20 23:49:05,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814688726] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:05,070 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:05,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:49:05,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224336955] [2022-02-20 23:49:05,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:05,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2022-02-20 23:49:05,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:05,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 23:49:05,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:05,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:49:05,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:05,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:49:05,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:49:05,080 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 23:49:05,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:05,373 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2022-02-20 23:49:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:49:05,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2022-02-20 23:49:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 23:49:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-02-20 23:49:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 23:49:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-02-20 23:49:05,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 112 transitions. [2022-02-20 23:49:05,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:05,508 INFO L225 Difference]: With dead ends: 95 [2022-02-20 23:49:05,508 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 23:49:05,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:05,510 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 77 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:05,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 70 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:49:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 23:49:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 39. [2022-02-20 23:49:05,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:05,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 39 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 38 states have internal predecessors, (46), 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 23:49:05,516 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 39 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 38 states have internal predecessors, (46), 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 23:49:05,517 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 39 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 38 states have internal predecessors, (46), 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 23:49:05,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:05,521 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2022-02-20 23:49:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-02-20 23:49:05,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:05,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:05,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 38 states have internal predecessors, (46), 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 95 states. [2022-02-20 23:49:05,523 INFO L87 Difference]: Start difference. First operand has 39 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 38 states have internal predecessors, (46), 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 95 states. [2022-02-20 23:49:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:05,527 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2022-02-20 23:49:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-02-20 23:49:05,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:05,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:05,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:05,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 38 states have internal predecessors, (46), 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 23:49:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-02-20 23:49:05,531 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 5 [2022-02-20 23:49:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:05,532 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-02-20 23:49:05,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 23:49:05,532 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-02-20 23:49:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:49:05,533 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:05,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:49:05,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:49:05,533 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2022-02-20 23:49:05,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash 889656834, now seen corresponding path program 1 times [2022-02-20 23:49:05,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:05,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773734859] [2022-02-20 23:49:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:05,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {529#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {529#true} is VALID [2022-02-20 23:49:05,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret6#1, main_#t~post5#1, main_#t~mem7#1, main_~i~2#1, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~2#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);main_~i~2#1 := 0; {531#(= |ULTIMATE.start_main_~i~2#1| 0)} is VALID [2022-02-20 23:49:05,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {531#(= |ULTIMATE.start_main_~i~2#1| 0)} assume !(main_~i~2#1 < 100); {530#false} is VALID [2022-02-20 23:49:05,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {530#false} main_~i~2#1 := 0; {530#false} is VALID [2022-02-20 23:49:05,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {530#false} assume !!(main_~i~2#1 < 100); {530#false} is VALID [2022-02-20 23:49:05,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {530#false} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~2#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~2#1); {530#false} is VALID [2022-02-20 23:49:05,560 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 23:49:05,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:05,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773734859] [2022-02-20 23:49:05,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773734859] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:05,561 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:05,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:49:05,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868172918] [2022-02-20 23:49:05,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:05,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 23:49:05,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:05,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:49:05,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:05,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:49:05,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:05,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:49:05,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:49:05,570 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:49:05,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:05,630 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-02-20 23:49:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:49:05,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 23:49:05,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:49:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-02-20 23:49:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:49:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-02-20 23:49:05,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-02-20 23:49:05,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:05,694 INFO L225 Difference]: With dead ends: 62 [2022-02-20 23:49:05,694 INFO L226 Difference]: Without dead ends: 62 [2022-02-20 23:49:05,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:49:05,696 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:05,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 55 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-20 23:49:05,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 38. [2022-02-20 23:49:05,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:05,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 38 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 37 states have internal predecessors, (43), 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 23:49:05,700 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 38 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 37 states have internal predecessors, (43), 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 23:49:05,701 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 38 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 37 states have internal predecessors, (43), 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 23:49:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:05,703 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-02-20 23:49:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-02-20 23:49:05,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:05,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:05,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 37 states have internal predecessors, (43), 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 62 states. [2022-02-20 23:49:05,704 INFO L87 Difference]: Start difference. First operand has 38 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 37 states have internal predecessors, (43), 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 62 states. [2022-02-20 23:49:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:05,706 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-02-20 23:49:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-02-20 23:49:05,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:05,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:05,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:05,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 37 states have internal predecessors, (43), 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 23:49:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-02-20 23:49:05,709 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 6 [2022-02-20 23:49:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:05,709 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-02-20 23:49:05,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:49:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-20 23:49:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:49:05,710 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:05,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:49:05,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:49:05,711 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2022-02-20 23:49:05,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:05,711 INFO L85 PathProgramCache]: Analyzing trace with hash 889666543, now seen corresponding path program 1 times [2022-02-20 23:49:05,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:05,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53389706] [2022-02-20 23:49:05,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:05,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:05,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {758#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {758#true} is VALID [2022-02-20 23:49:05,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {758#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret6#1, main_#t~post5#1, main_#t~mem7#1, main_~i~2#1, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~2#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);main_~i~2#1 := 0; {758#true} is VALID [2022-02-20 23:49:05,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {758#true} assume !!(main_~i~2#1 < 100);assume { :begin_inline_foo } true;foo_#in~n#1, foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~i~2#1, main_~#b~0#1.base, main_~#b~0#1.offset, 1 + main_~i~2#1;havoc foo_#res#1;havoc foo_#t~mem3#1, foo_#t~post2#1, foo_#t~ret4#1, foo_~n#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~#a~0#1.base, foo_~#a~0#1.offset, foo_~i~1#1;foo_~n#1 := foo_#in~n#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;call foo_~#a~0#1.base, foo_~#a~0#1.offset := #Ultimate.allocOnStack(4 * foo_~n#1);havoc foo_~i~1#1;foo_~i~1#1 := 0; {760#(= (select |#valid| |ULTIMATE.start_foo_~#a~0#1.base|) 1)} is VALID [2022-02-20 23:49:05,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {760#(= (select |#valid| |ULTIMATE.start_foo_~#a~0#1.base|) 1)} assume !!(foo_~i~1#1 < foo_~size#1); {760#(= (select |#valid| |ULTIMATE.start_foo_~#a~0#1.base|) 1)} is VALID [2022-02-20 23:49:05,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {760#(= (select |#valid| |ULTIMATE.start_foo_~#a~0#1.base|) 1)} SUMMARY for call foo_#t~mem3#1 := read~int(foo_~b#1.base, foo_~b#1.offset + 4 * foo_~i~1#1, 4); srcloc: L23 {760#(= (select |#valid| |ULTIMATE.start_foo_~#a~0#1.base|) 1)} is VALID [2022-02-20 23:49:05,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#(= (select |#valid| |ULTIMATE.start_foo_~#a~0#1.base|) 1)} assume !(1 == #valid[foo_~#a~0#1.base]); {759#false} is VALID [2022-02-20 23:49:05,751 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 23:49:05,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:05,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53389706] [2022-02-20 23:49:05,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53389706] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:05,752 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:05,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:49:05,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380543462] [2022-02-20 23:49:05,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:05,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 23:49:05,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:05,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:49:05,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:05,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:49:05,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:05,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:49:05,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:49:05,760 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:49:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:05,806 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-02-20 23:49:05,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:49:05,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 23:49:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:49:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-02-20 23:49:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:49:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-02-20 23:49:05,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-02-20 23:49:05,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:05,847 INFO L225 Difference]: With dead ends: 37 [2022-02-20 23:49:05,847 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 23:49:05,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:49:05,850 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:05,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 40 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:05,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 23:49:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-20 23:49:05,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:05,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 36 states have internal predecessors, (42), 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 23:49:05,853 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 36 states have internal predecessors, (42), 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 23:49:05,853 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 36 states have internal predecessors, (42), 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 23:49:05,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:05,855 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-02-20 23:49:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-02-20 23:49:05,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:05,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:05,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 36 states have internal predecessors, (42), 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 37 states. [2022-02-20 23:49:05,856 INFO L87 Difference]: Start difference. First operand has 37 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 36 states have internal predecessors, (42), 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 37 states. [2022-02-20 23:49:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:05,857 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-02-20 23:49:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-02-20 23:49:05,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:05,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:05,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:05,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 36 states have internal predecessors, (42), 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 23:49:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-02-20 23:49:05,860 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 6 [2022-02-20 23:49:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:05,860 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-02-20 23:49:05,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:49:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-02-20 23:49:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:49:05,865 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:05,865 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:49:05,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:49:05,866 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2022-02-20 23:49:05,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:05,868 INFO L85 PathProgramCache]: Analyzing trace with hash 889666544, now seen corresponding path program 1 times [2022-02-20 23:49:05,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:05,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212393469] [2022-02-20 23:49:05,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:05,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:49:05,895 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:49:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:49:05,924 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:49:05,925 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:49:05,926 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION (10 of 11 remaining) [2022-02-20 23:49:05,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (9 of 11 remaining) [2022-02-20 23:49:05,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (8 of 11 remaining) [2022-02-20 23:49:05,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (7 of 11 remaining) [2022-02-20 23:49:05,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (6 of 11 remaining) [2022-02-20 23:49:05,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (5 of 11 remaining) [2022-02-20 23:49:05,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (4 of 11 remaining) [2022-02-20 23:49:05,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (3 of 11 remaining) [2022-02-20 23:49:05,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (2 of 11 remaining) [2022-02-20 23:49:05,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (1 of 11 remaining) [2022-02-20 23:49:05,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2022-02-20 23:49:05,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:49:05,935 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 23:49:05,939 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:49:05,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:49:05 BoogieIcfgContainer [2022-02-20 23:49:05,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:49:05,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:49:05,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:49:05,970 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:49:05,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:04" (3/4) ... [2022-02-20 23:49:05,972 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:49:06,009 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:49:06,009 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:49:06,010 INFO L158 Benchmark]: Toolchain (without parser) took 2481.37ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 59.0MB in the beginning and 41.6MB in the end (delta: 17.4MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2022-02-20 23:49:06,011 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:49:06,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.04ms. Allocated memory is still 96.5MB. Free memory was 58.8MB in the beginning and 72.9MB in the end (delta: -14.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:49:06,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.89ms. Allocated memory is still 96.5MB. Free memory was 72.9MB in the beginning and 71.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:49:06,012 INFO L158 Benchmark]: Boogie Preprocessor took 39.51ms. Allocated memory is still 96.5MB. Free memory was 71.0MB in the beginning and 69.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:49:06,012 INFO L158 Benchmark]: RCFGBuilder took 338.56ms. Allocated memory is still 96.5MB. Free memory was 69.7MB in the beginning and 54.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 23:49:06,013 INFO L158 Benchmark]: TraceAbstraction took 1780.20ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 54.1MB in the beginning and 43.7MB in the end (delta: 10.5MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2022-02-20 23:49:06,013 INFO L158 Benchmark]: Witness Printer took 39.75ms. Allocated memory is still 117.4MB. Free memory was 43.7MB in the beginning and 41.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:49:06,014 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.17ms. Allocated memory is still 96.5MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.04ms. Allocated memory is still 96.5MB. Free memory was 58.8MB in the beginning and 72.9MB in the end (delta: -14.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.89ms. Allocated memory is still 96.5MB. Free memory was 72.9MB in the beginning and 71.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.51ms. Allocated memory is still 96.5MB. Free memory was 71.0MB in the beginning and 69.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 338.56ms. Allocated memory is still 96.5MB. Free memory was 69.7MB in the beginning and 54.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1780.20ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 54.1MB in the beginning and 43.7MB in the end (delta: 10.5MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Witness Printer took 39.75ms. Allocated memory is still 117.4MB. Free memory was 43.7MB in the beginning and 41.6MB in the end (delta: 2.1MB). 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 - CounterExampleResult [Line: 23]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L32] int i, b[100]; [L33] i = 0 VAL [b={3:0}, i=0] [L33] COND TRUE i < 100 [L34] CALL foo(i, b, i + 1) [L21] int a[n], i; [L22] i = 0 VAL [\old(n)=0, \old(size)=1, a={2:0}, b={3:0}, b={3:0}, i=0, n=0, size=1] [L22] COND TRUE i < size VAL [\old(n)=0, \old(size)=1, a={2:0}, b={3:0}, b={3:0}, i=0, n=0, size=1] [L23] EXPR b[i] VAL [\old(n)=0, \old(size)=1, a={2:0}, b={3:0}, b={3:0}, b[i]=401, i=0, n=0, size=1] [L23] a[i] = b[i] - UnprovableResult [Line: 23]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 31]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 208 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 120 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 80 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 80 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-20 23:49:06,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)