./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae 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/memory-alloca/c.03-alloca-2.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 279a496440714e08b745bf93c9b96ddf5eea3a1a1333716a32e013acf1d533d2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:22:21,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:22:21,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:22:21,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:22:21,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:22:21,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:22:21,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:22:21,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:22:21,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:22:21,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:22:21,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:22:21,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:22:21,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:22:21,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:22:21,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:22:21,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:22:21,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:22:21,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:22:21,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:22:21,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:22:21,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:22:21,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:22:21,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:22:21,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:22:21,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:22:21,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:22:21,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:22:21,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:22:21,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:22:21,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:22:21,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:22:21,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:22:21,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:22:21,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:22:21,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:22:21,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:22:21,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:22:21,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:22:21,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:22:21,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:22:21,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:22:21,310 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:22:21,359 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:22:21,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:22:21,359 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:22:21,360 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:22:21,360 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:22:21,360 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:22:21,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:22:21,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:22:21,361 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:22:21,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:22:21,361 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:22:21,361 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:22:21,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:22:21,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:22:21,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:22:21,361 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:22:21,362 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:22:21,362 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:22:21,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:22:21,362 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:22:21,362 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:22:21,362 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:22:21,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:22:21,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:22:21,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:22:21,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:22:21,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:22:21,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:22:21,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:22:21,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:22:21,363 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:22:21,363 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:22:21,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:22:21,363 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:22:21,363 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.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 -> 279a496440714e08b745bf93c9b96ddf5eea3a1a1333716a32e013acf1d533d2 [2023-02-16 03:22:21,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:22:21,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:22:21,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:22:21,606 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:22:21,607 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:22:21,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2023-02-16 03:22:22,657 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:22:22,881 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:22:22,881 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2023-02-16 03:22:22,897 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80fa5147f/f00123c68eaa43c086d365914163ae94/FLAG95d05d265 [2023-02-16 03:22:22,909 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80fa5147f/f00123c68eaa43c086d365914163ae94 [2023-02-16 03:22:22,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:22:22,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:22:22,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:22:22,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:22:22,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:22:22,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:22:22" (1/1) ... [2023-02-16 03:22:22,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac20ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:22:22, skipping insertion in model container [2023-02-16 03:22:22,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:22:22" (1/1) ... [2023-02-16 03:22:22,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:22:22,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:22:23,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:22:23,272 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:22:23,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:22:23,343 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:22:23,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:22:23 WrapperNode [2023-02-16 03:22:23,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:22:23,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:22:23,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:22:23,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:22:23,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:22:23" (1/1) ... [2023-02-16 03:22:23,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:22:23" (1/1) ... [2023-02-16 03:22:23,401 INFO L138 Inliner]: procedures = 116, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2023-02-16 03:22:23,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:22:23,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:22:23,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:22:23,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:22:23,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:22:23" (1/1) ... [2023-02-16 03:22:23,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:22:23" (1/1) ... [2023-02-16 03:22:23,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:22:23" (1/1) ... [2023-02-16 03:22:23,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:22:23" (1/1) ... [2023-02-16 03:22:23,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:22:23" (1/1) ... [2023-02-16 03:22:23,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:22:23" (1/1) ... [2023-02-16 03:22:23,439 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:22:23" (1/1) ... [2023-02-16 03:22:23,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:22:23" (1/1) ... [2023-02-16 03:22:23,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:22:23,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:22:23,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:22:23,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:22:23,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:22:23" (1/1) ... [2023-02-16 03:22:23,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:22:23,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:22:23,477 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) [2023-02-16 03:22:23,495 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 [2023-02-16 03:22:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 03:22:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:22:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 03:22:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:22:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:22:23,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:22:23,665 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:22:23,667 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:22:23,883 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:22:23,888 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:22:23,888 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 03:22:23,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:22:23 BoogieIcfgContainer [2023-02-16 03:22:23,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:22:23,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:22:23,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:22:23,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:22:23,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:22:22" (1/3) ... [2023-02-16 03:22:23,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418b34fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:22:23, skipping insertion in model container [2023-02-16 03:22:23,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:22:23" (2/3) ... [2023-02-16 03:22:23,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418b34fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:22:23, skipping insertion in model container [2023-02-16 03:22:23,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:22:23" (3/3) ... [2023-02-16 03:22:23,897 INFO L112 eAbstractionObserver]: Analyzing ICFG c.03-alloca-2.i [2023-02-16 03:22:23,912 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:22:23,912 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-02-16 03:22:23,969 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:22:23,975 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@20be6728, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:22:23,985 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-02-16 03:22:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-16 03:22:23,992 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:22:23,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-16 03:22:23,993 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:22:23,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:22:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-16 03:22:24,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:22:24,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199370680] [2023-02-16 03:22:24,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:22:24,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:22:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:22:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:22:24,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:22:24,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199370680] [2023-02-16 03:22:24,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199370680] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:22:24,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:22:24,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:22:24,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947114982] [2023-02-16 03:22:24,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:22:24,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:22:24,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:22:24,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:22:24,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:22:24,592 INFO L87 Difference]: Start difference. First operand has 58 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:24,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:22:24,689 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2023-02-16 03:22:24,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:22:24,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-16 03:22:24,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:22:24,697 INFO L225 Difference]: With dead ends: 53 [2023-02-16 03:22:24,697 INFO L226 Difference]: Without dead ends: 51 [2023-02-16 03:22:24,699 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 [2023-02-16 03:22:24,701 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:22:24,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 25 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:22:24,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-16 03:22:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-16 03:22:24,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 25 states have (on average 2.08) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2023-02-16 03:22:24,729 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 3 [2023-02-16 03:22:24,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:22:24,730 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2023-02-16 03:22:24,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:24,730 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2023-02-16 03:22:24,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-16 03:22:24,730 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:22:24,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-16 03:22:24,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:22:24,731 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:22:24,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:22:24,732 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-16 03:22:24,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:22:24,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350339043] [2023-02-16 03:22:24,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:22:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:22:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:22:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:22:24,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:22:24,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350339043] [2023-02-16 03:22:24,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350339043] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:22:24,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:22:24,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:22:24,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845827112] [2023-02-16 03:22:24,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:22:24,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:22:24,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:22:24,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:22:24,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:22:24,941 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:22:24,997 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2023-02-16 03:22:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:22:24,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-16 03:22:24,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:22:24,999 INFO L225 Difference]: With dead ends: 46 [2023-02-16 03:22:24,999 INFO L226 Difference]: Without dead ends: 46 [2023-02-16 03:22:24,999 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 [2023-02-16 03:22:25,000 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:22:25,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 23 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:22:25,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-16 03:22:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-02-16 03:22:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.88) internal successors, (47), 45 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2023-02-16 03:22:25,011 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 3 [2023-02-16 03:22:25,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:22:25,011 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2023-02-16 03:22:25,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2023-02-16 03:22:25,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-16 03:22:25,012 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:22:25,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-16 03:22:25,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:22:25,013 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:22:25,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:22:25,014 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2023-02-16 03:22:25,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:22:25,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117033879] [2023-02-16 03:22:25,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:22:25,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:22:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:22:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:22:25,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:22:25,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117033879] [2023-02-16 03:22:25,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117033879] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:22:25,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:22:25,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:22:25,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042419710] [2023-02-16 03:22:25,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:22:25,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:22:25,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:22:25,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:22:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:22:25,131 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:22:25,184 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2023-02-16 03:22:25,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:22:25,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-16 03:22:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:22:25,186 INFO L225 Difference]: With dead ends: 44 [2023-02-16 03:22:25,186 INFO L226 Difference]: Without dead ends: 44 [2023-02-16 03:22:25,187 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 [2023-02-16 03:22:25,193 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:22:25,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 20 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:22:25,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-16 03:22:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-16 03:22:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.8) internal successors, (45), 43 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2023-02-16 03:22:25,206 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 4 [2023-02-16 03:22:25,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:22:25,206 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2023-02-16 03:22:25,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,207 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2023-02-16 03:22:25,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-16 03:22:25,207 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:22:25,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-16 03:22:25,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:22:25,208 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:22:25,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:22:25,210 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2023-02-16 03:22:25,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:22:25,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908873668] [2023-02-16 03:22:25,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:22:25,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:22:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:22:25,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:22:25,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:22:25,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908873668] [2023-02-16 03:22:25,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908873668] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:22:25,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:22:25,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:22:25,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031162680] [2023-02-16 03:22:25,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:22:25,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:22:25,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:22:25,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:22:25,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:22:25,361 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:22:25,396 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2023-02-16 03:22:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:22:25,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-16 03:22:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:22:25,398 INFO L225 Difference]: With dead ends: 42 [2023-02-16 03:22:25,398 INFO L226 Difference]: Without dead ends: 42 [2023-02-16 03:22:25,398 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 [2023-02-16 03:22:25,405 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:22:25,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 21 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:22:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-16 03:22:25,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-02-16 03:22:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.72) internal successors, (43), 41 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2023-02-16 03:22:25,414 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 4 [2023-02-16 03:22:25,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:22:25,414 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2023-02-16 03:22:25,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2023-02-16 03:22:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:22:25,415 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:22:25,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:22:25,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:22:25,416 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:22:25,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:22:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2023-02-16 03:22:25,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:22:25,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173336329] [2023-02-16 03:22:25,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:22:25,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:22:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:22:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:22:25,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:22:25,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173336329] [2023-02-16 03:22:25,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173336329] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:22:25,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:22:25,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:22:25,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122820882] [2023-02-16 03:22:25,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:22:25,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:22:25,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:22:25,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:22:25,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:22:25,498 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:22:25,536 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2023-02-16 03:22:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:22:25,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-16 03:22:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:22:25,538 INFO L225 Difference]: With dead ends: 38 [2023-02-16 03:22:25,538 INFO L226 Difference]: Without dead ends: 38 [2023-02-16 03:22:25,538 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 [2023-02-16 03:22:25,539 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:22:25,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 16 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:22:25,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-16 03:22:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-16 03:22:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.56) internal successors, (39), 37 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2023-02-16 03:22:25,546 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 5 [2023-02-16 03:22:25,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:22:25,547 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2023-02-16 03:22:25,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2023-02-16 03:22:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:22:25,550 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:22:25,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:22:25,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:22:25,551 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:22:25,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:22:25,552 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2023-02-16 03:22:25,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:22:25,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466030126] [2023-02-16 03:22:25,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:22:25,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:22:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:22:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:22:25,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:22:25,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466030126] [2023-02-16 03:22:25,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466030126] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:22:25,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:22:25,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:22:25,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164455211] [2023-02-16 03:22:25,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:22:25,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:22:25,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:22:25,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:22:25,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:22:25,649 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:22:25,679 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-02-16 03:22:25,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:22:25,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-16 03:22:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:22:25,681 INFO L225 Difference]: With dead ends: 34 [2023-02-16 03:22:25,681 INFO L226 Difference]: Without dead ends: 34 [2023-02-16 03:22:25,682 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 [2023-02-16 03:22:25,682 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:22:25,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 17 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:22:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-16 03:22:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-16 03:22:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.4) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2023-02-16 03:22:25,684 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 5 [2023-02-16 03:22:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:22:25,684 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2023-02-16 03:22:25,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2023-02-16 03:22:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:22:25,684 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:22:25,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:22:25,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 03:22:25,685 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:22:25,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:22:25,685 INFO L85 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2023-02-16 03:22:25,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:22:25,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566663434] [2023-02-16 03:22:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:22:25,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:22:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:22:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:22:25,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:22:25,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566663434] [2023-02-16 03:22:25,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566663434] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:22:25,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:22:25,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:22:25,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510427860] [2023-02-16 03:22:25,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:22:25,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:22:25,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:22:25,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:22:25,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:22:25,736 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:22:25,763 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-02-16 03:22:25,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:22:25,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-16 03:22:25,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:22:25,765 INFO L225 Difference]: With dead ends: 30 [2023-02-16 03:22:25,765 INFO L226 Difference]: Without dead ends: 30 [2023-02-16 03:22:25,765 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 [2023-02-16 03:22:25,766 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:22:25,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 12 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:22:25,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-16 03:22:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-16 03:22:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-02-16 03:22:25,782 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 6 [2023-02-16 03:22:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:22:25,782 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-02-16 03:22:25,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-02-16 03:22:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:22:25,783 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:22:25,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:22:25,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 03:22:25,783 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:22:25,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:22:25,784 INFO L85 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2023-02-16 03:22:25,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:22:25,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201263762] [2023-02-16 03:22:25,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:22:25,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:22:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:22:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:22:25,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:22:25,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201263762] [2023-02-16 03:22:25,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201263762] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:22:25,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:22:25,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:22:25,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377781228] [2023-02-16 03:22:25,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:22:25,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:22:25,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:22:25,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:22:25,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:22:25,846 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:22:25,868 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2023-02-16 03:22:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:22:25,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-16 03:22:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:22:25,869 INFO L225 Difference]: With dead ends: 26 [2023-02-16 03:22:25,869 INFO L226 Difference]: Without dead ends: 26 [2023-02-16 03:22:25,869 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 [2023-02-16 03:22:25,870 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:22:25,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:22:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-16 03:22:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-16 03:22:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2023-02-16 03:22:25,872 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 6 [2023-02-16 03:22:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:22:25,873 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-02-16 03:22:25,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2023-02-16 03:22:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:22:25,873 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:22:25,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:22:25,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 03:22:25,875 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:22:25,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:22:25,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1831182508, now seen corresponding path program 1 times [2023-02-16 03:22:25,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:22:25,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994795162] [2023-02-16 03:22:25,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:22:25,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:22:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:22:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:22:26,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:22:26,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994795162] [2023-02-16 03:22:26,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994795162] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:22:26,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:22:26,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:22:26,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838800821] [2023-02-16 03:22:26,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:22:26,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:22:26,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:22:26,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:22:26,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:22:26,356 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:22:26,401 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2023-02-16 03:22:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:22:26,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-16 03:22:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:22:26,402 INFO L225 Difference]: With dead ends: 25 [2023-02-16 03:22:26,402 INFO L226 Difference]: Without dead ends: 0 [2023-02-16 03:22:26,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:22:26,404 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:22:26,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 19 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:22:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-16 03:22:26,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-16 03:22:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-16 03:22:26,406 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2023-02-16 03:22:26,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:22:26,406 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-16 03:22:26,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:22:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-16 03:22:26,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-16 03:22:26,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 31 remaining) [2023-02-16 03:22:26,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-02-16 03:22:26,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-02-16 03:22:26,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-02-16 03:22:26,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-02-16 03:22:26,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-02-16 03:22:26,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-02-16 03:22:26,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-02-16 03:22:26,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-02-16 03:22:26,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2023-02-16 03:22:26,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-02-16 03:22:26,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-02-16 03:22:26,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2023-02-16 03:22:26,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-02-16 03:22:26,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-02-16 03:22:26,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-02-16 03:22:26,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-02-16 03:22:26,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-02-16 03:22:26,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-02-16 03:22:26,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-02-16 03:22:26,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-02-16 03:22:26,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-02-16 03:22:26,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-02-16 03:22:26,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-02-16 03:22:26,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-02-16 03:22:26,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2023-02-16 03:22:26,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2023-02-16 03:22:26,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2023-02-16 03:22:26,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2023-02-16 03:22:26,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2023-02-16 03:22:26,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (0 of 31 remaining) [2023-02-16 03:22:26,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 03:22:26,417 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:22:26,419 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 03:22:26,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 03:22:26 BoogieIcfgContainer [2023-02-16 03:22:26,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 03:22:26,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 03:22:26,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 03:22:26,422 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 03:22:26,423 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:22:23" (3/4) ... [2023-02-16 03:22:26,425 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-16 03:22:26,435 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-02-16 03:22:26,436 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-16 03:22:26,436 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-16 03:22:26,436 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-16 03:22:26,471 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 03:22:26,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 03:22:26,474 INFO L158 Benchmark]: Toolchain (without parser) took 3561.42ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 81.1MB in the beginning and 121.5MB in the end (delta: -40.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2023-02-16 03:22:26,474 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 130.0MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:22:26,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.61ms. Allocated memory is still 130.0MB. Free memory was 81.1MB in the beginning and 65.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-16 03:22:26,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.99ms. Allocated memory is still 130.0MB. Free memory was 65.3MB in the beginning and 63.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 03:22:26,475 INFO L158 Benchmark]: Boogie Preprocessor took 42.23ms. Allocated memory is still 130.0MB. Free memory was 63.3MB in the beginning and 62.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:22:26,476 INFO L158 Benchmark]: RCFGBuilder took 445.40ms. Allocated memory is still 130.0MB. Free memory was 62.3MB in the beginning and 46.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-16 03:22:26,476 INFO L158 Benchmark]: TraceAbstraction took 2529.92ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 45.6MB in the beginning and 124.6MB in the end (delta: -79.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:22:26,476 INFO L158 Benchmark]: Witness Printer took 51.75ms. Allocated memory is still 180.4MB. Free memory was 124.6MB in the beginning and 121.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 03:22:26,478 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.20ms. Allocated memory is still 130.0MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.61ms. Allocated memory is still 130.0MB. Free memory was 81.1MB in the beginning and 65.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.99ms. Allocated memory is still 130.0MB. Free memory was 65.3MB in the beginning and 63.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.23ms. Allocated memory is still 130.0MB. Free memory was 63.3MB in the beginning and 62.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 445.40ms. Allocated memory is still 130.0MB. Free memory was 62.3MB in the beginning and 46.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2529.92ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 45.6MB in the beginning and 124.6MB in the end (delta: -79.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 51.75ms. Allocated memory is still 180.4MB. Free memory was 124.6MB in the beginning and 121.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 148 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 28, 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, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-02-16 03:22:26,510 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 Result: TRUE