./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i -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 ce305d75684696e5fabb4c8d08830bbd90a67b7669f979309850a29850c4f917 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:19:29,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:19:29,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:19:29,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:19:29,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:19:29,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:19:29,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:19:29,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:19:29,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:19:29,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:19:29,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:19:29,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:19:29,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:19:29,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:19:29,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:19:29,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:19:29,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:19:29,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:19:29,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:19:29,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:19:29,184 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:19:29,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:19:29,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:19:29,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:19:29,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:19:29,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:19:29,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:19:29,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:19:29,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:19:29,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:19:29,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:19:29,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:19:29,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:19:29,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:19:29,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:19:29,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:19:29,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:19:29,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:19:29,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:19:29,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:19:29,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:19:29,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:19:29,209 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:19:29,237 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:19:29,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:19:29,238 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:19:29,238 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:19:29,239 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:19:29,240 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:19:29,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:19:29,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:19:29,241 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:19:29,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:19:29,242 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:19:29,242 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:19:29,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:19:29,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:19:29,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:19:29,243 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:19:29,244 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:19:29,244 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:19:29,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:19:29,245 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:19:29,245 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:19:29,245 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:19:29,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:19:29,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:19:29,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:19:29,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:19:29,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:19:29,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:19:29,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:19:29,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:19:29,248 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 -> ce305d75684696e5fabb4c8d08830bbd90a67b7669f979309850a29850c4f917 [2022-07-12 18:19:29,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:19:29,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:19:29,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:19:29,523 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:19:29,524 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:19:29,525 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i [2022-07-12 18:19:29,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e8c02d61/195e0172f3db4deb9350e08d7a71f9f1/FLAGeb0dab8ba [2022-07-12 18:19:30,015 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:19:30,018 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i [2022-07-12 18:19:30,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e8c02d61/195e0172f3db4deb9350e08d7a71f9f1/FLAGeb0dab8ba [2022-07-12 18:19:30,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e8c02d61/195e0172f3db4deb9350e08d7a71f9f1 [2022-07-12 18:19:30,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:19:30,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:19:30,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:19:30,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:19:30,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:19:30,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:19:30" (1/1) ... [2022-07-12 18:19:30,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272c8526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:19:30, skipping insertion in model container [2022-07-12 18:19:30,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:19:30" (1/1) ... [2022-07-12 18:19:30,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:19:30,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:19:30,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:19:30,719 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:19:30,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:19:30,797 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:19:30,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:19:30 WrapperNode [2022-07-12 18:19:30,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:19:30,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:19:30,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:19:30,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:19:30,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:19:30" (1/1) ... [2022-07-12 18:19:30,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:19:30" (1/1) ... [2022-07-12 18:19:30,858 INFO L137 Inliner]: procedures = 118, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2022-07-12 18:19:30,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:19:30,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:19:30,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:19:30,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:19:30,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:19:30" (1/1) ... [2022-07-12 18:19:30,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:19:30" (1/1) ... [2022-07-12 18:19:30,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:19:30" (1/1) ... [2022-07-12 18:19:30,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:19:30" (1/1) ... [2022-07-12 18:19:30,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:19:30" (1/1) ... [2022-07-12 18:19:30,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:19:30" (1/1) ... [2022-07-12 18:19:30,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:19:30" (1/1) ... [2022-07-12 18:19:30,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:19:30,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:19:30,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:19:30,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:19:30,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:19:30" (1/1) ... [2022-07-12 18:19:30,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:19:30,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:30,919 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-07-12 18:19:30,920 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-07-12 18:19:30,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:19:30,955 INFO L130 BoogieDeclarations]: Found specification of procedure build_nondet_String [2022-07-12 18:19:30,956 INFO L138 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2022-07-12 18:19:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:19:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:19:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:19:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:19:30,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:19:31,041 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:19:31,042 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:19:31,263 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:19:31,269 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:19:31,269 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 18:19:31,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:19:31 BoogieIcfgContainer [2022-07-12 18:19:31,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:19:31,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:19:31,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:19:31,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:19:31,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:19:30" (1/3) ... [2022-07-12 18:19:31,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580e40f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:19:31, skipping insertion in model container [2022-07-12 18:19:31,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:19:30" (2/3) ... [2022-07-12 18:19:31,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580e40f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:19:31, skipping insertion in model container [2022-07-12 18:19:31,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:19:31" (3/3) ... [2022-07-12 18:19:31,278 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrpbrk_unsafe.i [2022-07-12 18:19:31,290 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:19:31,291 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-07-12 18:19:31,327 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:19:31,332 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7dc22e5b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@46a3f3ed [2022-07-12 18:19:31,333 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-07-12 18:19:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 62 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:19:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:19:31,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:31,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:31,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting build_nondet_StringErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-07-12 18:19:31,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:31,350 INFO L85 PathProgramCache]: Analyzing trace with hash 536414808, now seen corresponding path program 1 times [2022-07-12 18:19:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:31,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771582387] [2022-07-12 18:19:31,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:31,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:31,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:31,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771582387] [2022-07-12 18:19:31,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771582387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:19:31,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:19:31,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:19:31,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174582916] [2022-07-12 18:19:31,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:19:31,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 18:19:31,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:31,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 18:19:31,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 18:19:31,521 INFO L87 Difference]: Start difference. First operand has 66 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 62 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:31,541 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-07-12 18:19:31,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 18:19:31,543 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:19:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:31,549 INFO L225 Difference]: With dead ends: 66 [2022-07-12 18:19:31,549 INFO L226 Difference]: Without dead ends: 64 [2022-07-12 18:19:31,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 18:19:31,556 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:31,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:19:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-12 18:19:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-07-12 18:19:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.736842105263158) internal successors, (66), 60 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:19:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-07-12 18:19:31,597 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 8 [2022-07-12 18:19:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:31,598 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-07-12 18:19:31,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-07-12 18:19:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:19:31,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:31,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:31,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:19:31,601 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting build_nondet_StringErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-07-12 18:19:31,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:31,602 INFO L85 PathProgramCache]: Analyzing trace with hash 536414498, now seen corresponding path program 1 times [2022-07-12 18:19:31,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:31,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228790082] [2022-07-12 18:19:31,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:31,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:31,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:31,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228790082] [2022-07-12 18:19:31,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228790082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:19:31,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:19:31,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:19:31,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661435280] [2022-07-12 18:19:31,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:19:31,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:19:31,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:31,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:19:31,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:19:31,736 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:31,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:31,800 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-07-12 18:19:31,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:19:31,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:19:31,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:31,802 INFO L225 Difference]: With dead ends: 62 [2022-07-12 18:19:31,803 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 18:19:31,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-12 18:19:31,805 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:31,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:19:31,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 18:19:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-12 18:19:31,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 58 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:19:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-12 18:19:31,816 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 8 [2022-07-12 18:19:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:31,818 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-12 18:19:31,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-12 18:19:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:19:31,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:31,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:31,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:19:31,822 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting build_nondet_StringErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-07-12 18:19:31,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:31,825 INFO L85 PathProgramCache]: Analyzing trace with hash 536414499, now seen corresponding path program 1 times [2022-07-12 18:19:31,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:31,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563896047] [2022-07-12 18:19:31,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:31,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:31,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:31,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563896047] [2022-07-12 18:19:31,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563896047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:19:31,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:19:31,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:19:31,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66935231] [2022-07-12 18:19:31,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:19:31,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:19:31,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:31,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:19:31,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:19:31,886 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:31,913 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-07-12 18:19:31,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:19:31,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:19:31,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:31,915 INFO L225 Difference]: With dead ends: 61 [2022-07-12 18:19:31,915 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 18:19:31,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:19:31,918 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:31,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 114 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:19:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 18:19:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-12 18:19:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:19:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-07-12 18:19:31,928 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 8 [2022-07-12 18:19:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:31,928 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-07-12 18:19:31,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-07-12 18:19:31,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:19:31,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:31,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:31,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:19:31,930 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-07-12 18:19:31,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:31,936 INFO L85 PathProgramCache]: Analyzing trace with hash 536414552, now seen corresponding path program 1 times [2022-07-12 18:19:31,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:31,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068780494] [2022-07-12 18:19:31,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:31,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:31,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:31,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068780494] [2022-07-12 18:19:31,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068780494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:19:31,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:19:31,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:19:31,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996061418] [2022-07-12 18:19:31,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:19:31,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:19:31,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:31,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:19:31,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:19:31,994 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:32,025 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-07-12 18:19:32,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:19:32,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:19:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:32,029 INFO L225 Difference]: With dead ends: 67 [2022-07-12 18:19:32,030 INFO L226 Difference]: Without dead ends: 67 [2022-07-12 18:19:32,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:19:32,033 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 9 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:32,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:19:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-12 18:19:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2022-07-12 18:19:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.625) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:19:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-07-12 18:19:32,044 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 8 [2022-07-12 18:19:32,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:32,044 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-07-12 18:19:32,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-07-12 18:19:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:19:32,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:32,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:32,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:19:32,045 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-07-12 18:19:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash 536474134, now seen corresponding path program 1 times [2022-07-12 18:19:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:32,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176574114] [2022-07-12 18:19:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:32,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:32,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:32,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176574114] [2022-07-12 18:19:32,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176574114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:19:32,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:19:32,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:19:32,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631644022] [2022-07-12 18:19:32,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:19:32,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:19:32,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:32,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:19:32,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:19:32,103 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:32,188 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-07-12 18:19:32,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:19:32,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:19:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:32,189 INFO L225 Difference]: With dead ends: 71 [2022-07-12 18:19:32,190 INFO L226 Difference]: Without dead ends: 71 [2022-07-12 18:19:32,190 INFO L412 NwaCegarLoop]: 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-07-12 18:19:32,197 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:32,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 148 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:19:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-12 18:19:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2022-07-12 18:19:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.619047619047619) internal successors, (68), 61 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:19:32,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-07-12 18:19:32,209 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 8 [2022-07-12 18:19:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:32,209 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-07-12 18:19:32,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-07-12 18:19:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:19:32,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:32,210 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:32,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:19:32,211 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-07-12 18:19:32,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:32,211 INFO L85 PathProgramCache]: Analyzing trace with hash -824984615, now seen corresponding path program 1 times [2022-07-12 18:19:32,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:32,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38010773] [2022-07-12 18:19:32,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:32,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:32,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:32,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38010773] [2022-07-12 18:19:32,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38010773] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:32,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16421071] [2022-07-12 18:19:32,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:32,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:32,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:32,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:19:32,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 18:19:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:32,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:19:32,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:32,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:19:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:32,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:32,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16421071] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:32,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:32,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-07-12 18:19:32,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604660927] [2022-07-12 18:19:32,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:32,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:19:32,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:32,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:19:32,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:19:32,723 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:32,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:32,873 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2022-07-12 18:19:32,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:19:32,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 18:19:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:32,876 INFO L225 Difference]: With dead ends: 75 [2022-07-12 18:19:32,876 INFO L226 Difference]: Without dead ends: 75 [2022-07-12 18:19:32,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:19:32,880 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 37 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:32,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 243 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:19:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-12 18:19:32,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2022-07-12 18:19:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:19:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-12 18:19:32,896 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 12 [2022-07-12 18:19:32,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:32,896 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-12 18:19:32,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:32,897 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-12 18:19:32,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:19:32,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:32,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:32,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:19:33,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 18:19:33,116 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-07-12 18:19:33,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:33,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2141124204, now seen corresponding path program 1 times [2022-07-12 18:19:33,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:33,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009347460] [2022-07-12 18:19:33,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:33,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:33,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:19:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:33,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 18:19:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:19:33,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:33,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009347460] [2022-07-12 18:19:33,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009347460] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:33,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164534120] [2022-07-12 18:19:33,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:33,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:33,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:33,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:19:33,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 18:19:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:33,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 18:19:33,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:33,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:19:33,565 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:19:33,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 18:19:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:33,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:33,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164534120] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:33,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:19:33,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2022-07-12 18:19:33,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615447754] [2022-07-12 18:19:33,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:33,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:19:33,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:33,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:19:33,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:19:33,655 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 18:19:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:33,853 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-07-12 18:19:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:19:33,853 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-07-12 18:19:33,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:33,854 INFO L225 Difference]: With dead ends: 102 [2022-07-12 18:19:33,854 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 18:19:33,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:19:33,855 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 114 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:33,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 274 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 204 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2022-07-12 18:19:33,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 18:19:33,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2022-07-12 18:19:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.621212121212121) internal successors, (107), 83 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 18:19:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2022-07-12 18:19:33,860 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 23 [2022-07-12 18:19:33,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:33,861 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2022-07-12 18:19:33,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 18:19:33,861 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2022-07-12 18:19:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:19:33,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:33,862 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:33,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:19:34,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-12 18:19:34,084 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-07-12 18:19:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:34,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2141124205, now seen corresponding path program 1 times [2022-07-12 18:19:34,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:34,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740657623] [2022-07-12 18:19:34,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:34,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:34,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:19:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:34,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 18:19:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:19:34,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:34,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740657623] [2022-07-12 18:19:34,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740657623] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:34,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474196205] [2022-07-12 18:19:34,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:34,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:34,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:34,351 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:19:34,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 18:19:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:34,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 18:19:34,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:34,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:19:34,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:19:34,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:19:34,676 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:19:34,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:19:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:34,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:40,831 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:19:40,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474196205] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:40,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:19:40,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2022-07-12 18:19:40,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987555771] [2022-07-12 18:19:40,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:40,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 18:19:40,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:40,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 18:19:40,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-07-12 18:19:40,834 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand has 23 states, 20 states have (on average 1.75) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 18:19:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:41,257 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2022-07-12 18:19:41,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:19:41,258 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.75) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-07-12 18:19:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:41,259 INFO L225 Difference]: With dead ends: 147 [2022-07-12 18:19:41,259 INFO L226 Difference]: Without dead ends: 147 [2022-07-12 18:19:41,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2022-07-12 18:19:41,260 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 232 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:41,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 319 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 350 Invalid, 0 Unknown, 25 Unchecked, 0.2s Time] [2022-07-12 18:19:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-12 18:19:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 87. [2022-07-12 18:19:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.537313432835821) internal successors, (103), 82 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 18:19:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2022-07-12 18:19:41,265 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 23 [2022-07-12 18:19:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:41,266 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2022-07-12 18:19:41,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.75) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 18:19:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2022-07-12 18:19:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:19:41,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:41,267 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:41,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:19:41,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:41,468 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-07-12 18:19:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:41,468 INFO L85 PathProgramCache]: Analyzing trace with hash 288202460, now seen corresponding path program 1 times [2022-07-12 18:19:41,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:41,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328180586] [2022-07-12 18:19:41,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:41,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:19:41,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 18:19:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:19:41,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 18:19:41,551 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 18:19:41,552 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 23 remaining) [2022-07-12 18:19:41,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2022-07-12 18:19:41,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2022-07-12 18:19:41,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2022-07-12 18:19:41,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2022-07-12 18:19:41,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2022-07-12 18:19:41,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2022-07-12 18:19:41,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2022-07-12 18:19:41,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2022-07-12 18:19:41,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2022-07-12 18:19:41,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2022-07-12 18:19:41,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2022-07-12 18:19:41,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2022-07-12 18:19:41,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2022-07-12 18:19:41,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2022-07-12 18:19:41,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2022-07-12 18:19:41,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (6 of 23 remaining) [2022-07-12 18:19:41,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 23 remaining) [2022-07-12 18:19:41,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2022-07-12 18:19:41,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2022-07-12 18:19:41,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2022-07-12 18:19:41,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 23 remaining) [2022-07-12 18:19:41,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2022-07-12 18:19:41,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:19:41,561 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:41,566 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 18:19:41,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:19:41 BoogieIcfgContainer [2022-07-12 18:19:41,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 18:19:41,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 18:19:41,609 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 18:19:41,609 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 18:19:41,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:19:31" (3/4) ... [2022-07-12 18:19:41,611 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 18:19:41,652 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 18:19:41,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 18:19:41,653 INFO L158 Benchmark]: Toolchain (without parser) took 11273.98ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 55.1MB in the beginning and 99.1MB in the end (delta: -44.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:19:41,653 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory was 72.2MB in the beginning and 72.2MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:19:41,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.35ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 54.9MB in the beginning and 80.7MB in the end (delta: -25.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 18:19:41,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.53ms. Allocated memory is still 111.1MB. Free memory was 80.7MB in the beginning and 78.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:19:41,655 INFO L158 Benchmark]: Boogie Preprocessor took 29.50ms. Allocated memory is still 111.1MB. Free memory was 78.9MB in the beginning and 77.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:19:41,655 INFO L158 Benchmark]: RCFGBuilder took 381.06ms. Allocated memory is still 111.1MB. Free memory was 77.6MB in the beginning and 63.6MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 18:19:41,655 INFO L158 Benchmark]: TraceAbstraction took 10335.62ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 63.3MB in the beginning and 101.2MB in the end (delta: -37.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:19:41,656 INFO L158 Benchmark]: Witness Printer took 44.21ms. Allocated memory is still 134.2MB. Free memory was 101.2MB in the beginning and 99.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:19:41,659 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory was 72.2MB in the beginning and 72.2MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.35ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 54.9MB in the beginning and 80.7MB in the end (delta: -25.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.53ms. Allocated memory is still 111.1MB. Free memory was 80.7MB in the beginning and 78.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.50ms. Allocated memory is still 111.1MB. Free memory was 78.9MB in the beginning and 77.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 381.06ms. Allocated memory is still 111.1MB. Free memory was 77.6MB in the beginning and 63.6MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10335.62ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 63.3MB in the beginning and 101.2MB in the end (delta: -37.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 44.21ms. Allocated memory is still 134.2MB. Free memory was 101.2MB in the beginning and 99.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L546] CALL, EXPR build_nondet_String() [L515] int length = __VERIFIER_nondet_int(); [L516] COND TRUE length < 1 [L517] length = 1 VAL [length=1] [L519] char* nondetString = (char*) malloc(length * sizeof(char)); [L521] int i = 0; VAL [i=0, length=1, nondetString={-1:0}] [L521] COND FALSE !(i < length - 1) VAL [i=0, length=1, nondetString={-1:0}] [L527] nondetString[length-1] = '\0' VAL [i=0, length=1, nondetString={-1:0}] [L528] return nondetString; VAL [\result={-1:0}, i=0, length=1, nondetString={-1:0}] [L546] RET, EXPR build_nondet_String() VAL [build_nondet_String()={-1:0}] [L546] char* s1 = build_nondet_String(); [L547] CALL, EXPR build_nondet_String() [L515] int length = __VERIFIER_nondet_int(); [L516] COND TRUE length < 1 [L517] length = 1 VAL [length=1] [L519] char* nondetString = (char*) malloc(length * sizeof(char)); [L521] int i = 0; VAL [i=0, length=1, nondetString={-2:0}] [L521] COND FALSE !(i < length - 1) VAL [i=0, length=1, nondetString={-2:0}] [L527] nondetString[length-1] = '\0' VAL [i=0, length=1, nondetString={-2:0}] [L528] return nondetString; VAL [\result={-2:0}, i=0, length=1, nondetString={-2:0}] [L547] RET, EXPR build_nondet_String() VAL [build_nondet_String()={-2:0}, s1={-1:0}] [L547] char* s2 = build_nondet_String(); [L548] CALL cstrpbrk(s1,s2) [L532] const char *sc1; [L533] const char *s; [L534] int c; [L535] sc1 = s1 VAL [s1={-1:0}, s1={-1:0}, s2={-2:0}, s2={-2:0}, sc1={-1:0}] [L535] EXPR \read(*sc1) VAL [\read(*sc1)=0, s1={-1:0}, s1={-1:0}, s2={-2:0}, s2={-2:0}, sc1={-1:0}] [L535] COND FALSE !(*sc1 != '\0') [L543] return 0; VAL [\result={0:0}, s1={-1:0}, s1={-1:0}, s2={-2:0}, s2={-2:0}, sc1={-1:0}] [L548] RET cstrpbrk(s1,s2) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: 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 2 procedures, 66 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 428 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 428 mSDsluCounter, 1393 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 79 IncrementalHoareTripleChecker+Unchecked, 931 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 783 IncrementalHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 462 mSDtfsCounter, 783 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=7, InterpolantAutomatonStates: 49, 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, 8 MinimizatonAttempts, 97 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 156 ConstructedInterpolants, 10 QuantifiedInterpolants, 1188 SizeOfPredicates, 16 NumberOfNonLiveVariables, 316 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 14/38 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-07-12 18:19:41,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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)