./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/list-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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/list-ext-properties/list-ext.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 75539a96800eea0d91d3dad14f0ad356c5f8079fa4f6dcf5bbfcb193296a44a8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:47:41,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:47:41,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:47:41,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:47:41,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:47:41,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:47:41,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:47:41,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:47:41,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:47:41,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:47:41,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:47:41,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:47:41,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:47:41,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:47:41,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:47:41,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:47:41,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:47:41,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:47:41,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:47:41,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:47:41,917 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:47:41,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:47:41,918 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:47:41,919 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:47:41,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:47:41,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:47:41,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:47:41,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:47:41,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:47:41,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:47:41,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:47:41,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:47:41,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:47:41,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:47:41,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:47:41,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:47:41,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:47:41,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:47:41,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:47:41,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:47:41,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:47:41,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:47:41,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:47:41,952 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:47:41,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:47:41,952 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:47:41,952 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:47:41,953 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:47:41,953 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:47:41,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:47:41,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:47:41,954 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:47:41,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:47:41,955 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:47:41,955 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:47:41,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:47:41,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:47:41,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:47:41,955 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:47:41,955 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:47:41,955 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:47:41,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:47:41,956 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:47:41,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:47:41,956 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:47:41,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:47:41,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:47:41,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:47:41,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:47:41,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:47:41,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:47:41,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:47:41,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:47:41,957 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 75539a96800eea0d91d3dad14f0ad356c5f8079fa4f6dcf5bbfcb193296a44a8 [2022-07-20 05:47:42,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:47:42,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:47:42,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:47:42,177 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:47:42,177 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:47:42,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext.i [2022-07-20 05:47:42,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec6645217/5440d867e328409bb82c5be2da14e166/FLAG819f2cfbe [2022-07-20 05:47:42,608 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:47:42,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext.i [2022-07-20 05:47:42,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec6645217/5440d867e328409bb82c5be2da14e166/FLAG819f2cfbe [2022-07-20 05:47:42,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec6645217/5440d867e328409bb82c5be2da14e166 [2022-07-20 05:47:42,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:47:42,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:47:42,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:47:42,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:47:42,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:47:42,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:47:42" (1/1) ... [2022-07-20 05:47:42,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f2f094c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:42, skipping insertion in model container [2022-07-20 05:47:42,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:47:42" (1/1) ... [2022-07-20 05:47:42,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:47:42,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:47:42,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext.i[23551,23564] [2022-07-20 05:47:42,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:47:42,935 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:47:42,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext.i[23551,23564] [2022-07-20 05:47:42,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:47:42,990 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:47:42,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:42 WrapperNode [2022-07-20 05:47:42,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:47:42,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:47:42,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:47:42,991 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:47:42,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:42" (1/1) ... [2022-07-20 05:47:43,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:42" (1/1) ... [2022-07-20 05:47:43,030 INFO L137 Inliner]: procedures = 124, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 128 [2022-07-20 05:47:43,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:47:43,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:47:43,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:47:43,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:47:43,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:42" (1/1) ... [2022-07-20 05:47:43,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:42" (1/1) ... [2022-07-20 05:47:43,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:42" (1/1) ... [2022-07-20 05:47:43,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:42" (1/1) ... [2022-07-20 05:47:43,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:42" (1/1) ... [2022-07-20 05:47:43,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:42" (1/1) ... [2022-07-20 05:47:43,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:42" (1/1) ... [2022-07-20 05:47:43,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:47:43,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:47:43,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:47:43,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:47:43,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:42" (1/1) ... [2022-07-20 05:47:43,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:47:43,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:43,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 05:47:43,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 05:47:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-20 05:47:43,108 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-20 05:47:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 05:47:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 05:47:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:47:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:47:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:47:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:47:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:47:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 05:47:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:47:43,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:47:43,176 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:47:43,177 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:47:43,212 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-20 05:47:43,409 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:47:43,414 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:47:43,414 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-20 05:47:43,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:47:43 BoogieIcfgContainer [2022-07-20 05:47:43,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:47:43,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:47:43,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:47:43,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:47:43,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:47:42" (1/3) ... [2022-07-20 05:47:43,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cc2f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:47:43, skipping insertion in model container [2022-07-20 05:47:43,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:42" (2/3) ... [2022-07-20 05:47:43,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cc2f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:47:43, skipping insertion in model container [2022-07-20 05:47:43,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:47:43" (3/3) ... [2022-07-20 05:47:43,421 INFO L111 eAbstractionObserver]: Analyzing ICFG list-ext.i [2022-07-20 05:47:43,430 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:47:43,430 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-07-20 05:47:43,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:47:43,462 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7dc5564c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@53482856 [2022-07-20 05:47:43,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-07-20 05:47:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 91 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:43,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:47:43,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:43,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:43,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:43,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:43,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2098269937, now seen corresponding path program 1 times [2022-07-20 05:47:43,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:43,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977336552] [2022-07-20 05:47:43,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:43,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:43,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:43,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977336552] [2022-07-20 05:47:43,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977336552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:43,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:43,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:47:43,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610386330] [2022-07-20 05:47:43,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:43,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 05:47:43,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:43,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 05:47:43,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 05:47:43,588 INFO L87 Difference]: Start difference. First operand has 93 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 91 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:43,607 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-07-20 05:47:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 05:47:43,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-07-20 05:47:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:43,614 INFO L225 Difference]: With dead ends: 93 [2022-07-20 05:47:43,614 INFO L226 Difference]: Without dead ends: 86 [2022-07-20 05:47:43,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 05:47:43,619 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:43,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:43,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-20 05:47:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-20 05:47:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-07-20 05:47:43,657 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 7 [2022-07-20 05:47:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:43,657 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-07-20 05:47:43,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-07-20 05:47:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:47:43,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:43,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:43,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:47:43,659 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash 620871786, now seen corresponding path program 1 times [2022-07-20 05:47:43,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:43,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209471053] [2022-07-20 05:47:43,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:43,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:43,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:43,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209471053] [2022-07-20 05:47:43,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209471053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:43,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:43,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:47:43,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813232803] [2022-07-20 05:47:43,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:43,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:47:43,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:43,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:47:43,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:47:43,723 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:43,860 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2022-07-20 05:47:43,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:47:43,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-07-20 05:47:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:43,862 INFO L225 Difference]: With dead ends: 107 [2022-07-20 05:47:43,862 INFO L226 Difference]: Without dead ends: 107 [2022-07-20 05:47:43,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:47:43,864 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 160 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:43,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 52 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-20 05:47:43,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2022-07-20 05:47:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2022-07-20 05:47:43,875 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 8 [2022-07-20 05:47:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:43,876 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2022-07-20 05:47:43,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-07-20 05:47:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:47:43,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:43,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:43,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:47:43,878 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:43,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:43,882 INFO L85 PathProgramCache]: Analyzing trace with hash 620871787, now seen corresponding path program 1 times [2022-07-20 05:47:43,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:43,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790319596] [2022-07-20 05:47:43,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:43,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:43,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:43,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790319596] [2022-07-20 05:47:43,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790319596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:43,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:43,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:47:43,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577191138] [2022-07-20 05:47:43,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:43,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:47:43,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:43,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:47:43,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:47:43,966 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:44,075 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2022-07-20 05:47:44,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:47:44,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-07-20 05:47:44,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:44,076 INFO L225 Difference]: With dead ends: 124 [2022-07-20 05:47:44,076 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 05:47:44,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:47:44,077 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 167 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:44,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 60 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 05:47:44,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2022-07-20 05:47:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.5125) internal successors, (121), 106 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-07-20 05:47:44,083 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 8 [2022-07-20 05:47:44,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:44,084 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-07-20 05:47:44,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-07-20 05:47:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:47:44,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:44,085 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:44,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:47:44,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:44,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:44,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204644, now seen corresponding path program 1 times [2022-07-20 05:47:44,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:44,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630482542] [2022-07-20 05:47:44,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:44,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:44,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:44,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630482542] [2022-07-20 05:47:44,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630482542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:44,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:44,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:47:44,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612935935] [2022-07-20 05:47:44,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:44,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:44,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:44,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:44,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:44,162 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:44,346 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2022-07-20 05:47:44,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:47:44,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-07-20 05:47:44,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:44,350 INFO L225 Difference]: With dead ends: 152 [2022-07-20 05:47:44,350 INFO L226 Difference]: Without dead ends: 152 [2022-07-20 05:47:44,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:47:44,360 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 115 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:44,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 240 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:47:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-20 05:47:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 111. [2022-07-20 05:47:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 110 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2022-07-20 05:47:44,373 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 17 [2022-07-20 05:47:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:44,373 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2022-07-20 05:47:44,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2022-07-20 05:47:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:47:44,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:44,374 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:44,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:47:44,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:44,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:44,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204645, now seen corresponding path program 1 times [2022-07-20 05:47:44,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:44,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185189421] [2022-07-20 05:47:44,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:44,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:44,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185189421] [2022-07-20 05:47:44,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185189421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:44,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:44,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:47:44,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60805488] [2022-07-20 05:47:44,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:44,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:44,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:44,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:44,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:44,478 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:44,692 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2022-07-20 05:47:44,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:47:44,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-07-20 05:47:44,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:44,693 INFO L225 Difference]: With dead ends: 155 [2022-07-20 05:47:44,693 INFO L226 Difference]: Without dead ends: 155 [2022-07-20 05:47:44,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:47:44,694 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 79 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:44,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 307 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:47:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-20 05:47:44,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 95. [2022-07-20 05:47:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-07-20 05:47:44,699 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 17 [2022-07-20 05:47:44,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:44,699 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-07-20 05:47:44,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-07-20 05:47:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:47:44,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:44,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:44,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:47:44,701 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:44,701 INFO L85 PathProgramCache]: Analyzing trace with hash -808483032, now seen corresponding path program 1 times [2022-07-20 05:47:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:44,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908539267] [2022-07-20 05:47:44,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:44,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:44,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:44,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908539267] [2022-07-20 05:47:44,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908539267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:44,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:44,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:47:44,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934523696] [2022-07-20 05:47:44,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:44,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:47:44,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:44,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:47:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:47:44,785 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:44,925 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2022-07-20 05:47:44,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:47:44,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2022-07-20 05:47:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:44,926 INFO L225 Difference]: With dead ends: 187 [2022-07-20 05:47:44,927 INFO L226 Difference]: Without dead ends: 187 [2022-07-20 05:47:44,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:47:44,927 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 118 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:44,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 231 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-20 05:47:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 106. [2022-07-20 05:47:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 105 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2022-07-20 05:47:44,932 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 18 [2022-07-20 05:47:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:44,932 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2022-07-20 05:47:44,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2022-07-20 05:47:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:47:44,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:44,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:44,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:47:44,934 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:44,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash 389256394, now seen corresponding path program 1 times [2022-07-20 05:47:44,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:44,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009666996] [2022-07-20 05:47:44,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:44,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:47:44,948 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 05:47:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:47:44,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 05:47:44,984 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 05:47:44,985 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2022-07-20 05:47:44,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2022-07-20 05:47:44,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2022-07-20 05:47:44,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2022-07-20 05:47:44,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2022-07-20 05:47:44,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2022-07-20 05:47:44,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2022-07-20 05:47:44,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2022-07-20 05:47:44,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2022-07-20 05:47:44,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2022-07-20 05:47:44,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2022-07-20 05:47:44,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2022-07-20 05:47:44,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2022-07-20 05:47:44,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2022-07-20 05:47:44,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2022-07-20 05:47:44,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2022-07-20 05:47:44,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2022-07-20 05:47:44,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2022-07-20 05:47:44,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2022-07-20 05:47:44,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2022-07-20 05:47:44,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2022-07-20 05:47:44,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2022-07-20 05:47:44,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2022-07-20 05:47:44,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2022-07-20 05:47:44,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2022-07-20 05:47:44,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2022-07-20 05:47:44,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2022-07-20 05:47:44,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2022-07-20 05:47:44,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2022-07-20 05:47:44,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2022-07-20 05:47:44,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2022-07-20 05:47:44,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (6 of 38 remaining) [2022-07-20 05:47:44,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (5 of 38 remaining) [2022-07-20 05:47:44,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (4 of 38 remaining) [2022-07-20 05:47:44,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (3 of 38 remaining) [2022-07-20 05:47:44,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (2 of 38 remaining) [2022-07-20 05:47:44,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (1 of 38 remaining) [2022-07-20 05:47:44,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2022-07-20 05:47:44,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 05:47:44,996 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:44,999 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 05:47:45,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:47:45 BoogieIcfgContainer [2022-07-20 05:47:45,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 05:47:45,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 05:47:45,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 05:47:45,016 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 05:47:45,017 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:47:43" (3/4) ... [2022-07-20 05:47:45,019 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 05:47:45,019 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 05:47:45,019 INFO L158 Benchmark]: Toolchain (without parser) took 2389.19ms. Allocated memory was 127.9MB in the beginning and 176.2MB in the end (delta: 48.2MB). Free memory was 88.2MB in the beginning and 126.7MB in the end (delta: -38.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-07-20 05:47:45,020 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory was 105.7MB in the beginning and 105.6MB in the end (delta: 70.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:47:45,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.09ms. Allocated memory is still 127.9MB. Free memory was 88.0MB in the beginning and 92.9MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 05:47:45,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.12ms. Allocated memory is still 127.9MB. Free memory was 92.9MB in the beginning and 90.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:47:45,020 INFO L158 Benchmark]: Boogie Preprocessor took 26.49ms. Allocated memory is still 127.9MB. Free memory was 90.9MB in the beginning and 89.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:47:45,021 INFO L158 Benchmark]: RCFGBuilder took 356.63ms. Allocated memory is still 127.9MB. Free memory was 89.3MB in the beginning and 71.2MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-20 05:47:45,021 INFO L158 Benchmark]: TraceAbstraction took 1598.65ms. Allocated memory was 127.9MB in the beginning and 176.2MB in the end (delta: 48.2MB). Free memory was 70.8MB in the beginning and 126.7MB in the end (delta: -55.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:47:45,021 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 176.2MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:47:45,022 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.13ms. Allocated memory is still 127.9MB. Free memory was 105.7MB in the beginning and 105.6MB in the end (delta: 70.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.09ms. Allocated memory is still 127.9MB. Free memory was 88.0MB in the beginning and 92.9MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.12ms. Allocated memory is still 127.9MB. Free memory was 92.9MB in the beginning and 90.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.49ms. Allocated memory is still 127.9MB. Free memory was 90.9MB in the beginning and 89.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.63ms. Allocated memory is still 127.9MB. Free memory was 89.3MB in the beginning and 71.2MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1598.65ms. Allocated memory was 127.9MB in the beginning and 176.2MB in the end (delta: 48.2MB). Free memory was 70.8MB in the beginning and 126.7MB in the end (delta: -55.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 176.2MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 568]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 568. Possible FailurePath: [L532] int i = 0; [L533] int y = 0; [L534] List a = (List) malloc(sizeof(struct node)); [L535] COND FALSE !(a == 0) VAL [a={-1:0}, i=0, y=0] [L536] List t; [L537] List p = a; VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L538] i < 10 && __VERIFIER_nondet_int() [L538] i < 10 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={-1:0}, i=0, i < 10 && __VERIFIER_nondet_int()=0, p={-1:0}, y=0] [L538] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L546] y < 10 && __VERIFIER_nondet_int() [L546] y < 10 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={-1:0}, i=0, p={-1:0}, y=0, y < 10 && __VERIFIER_nondet_int()=0] [L546] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L554] p->h = 3 VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L555] p->n = 0 VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L556] i = 0 [L557] y = 0 [L558] p = a VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L559] EXPR p->h VAL [a={-1:0}, i=0, p={-1:0}, p->h=3, y=0] [L559] COND FALSE !(p->h == 1) [L563] EXPR p->h VAL [a={-1:0}, i=0, p={-1:0}, p->h=3, y=0] [L563] COND FALSE !(p->h == 2) [L567] EXPR p->h VAL [a={-1:0}, i=0, p={-1:0}, p->h=3, y=0] [L567] COND TRUE p->h != 3 || (i + y) < 20 [L568] reach_error() VAL [a={-1:0}, i=0, p={-1:0}, y=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 639 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 639 mSDsluCounter, 992 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 587 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 972 IncrementalHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 405 mSDtfsCounter, 972 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=4, InterpolantAutomatonStates: 33, 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, 6 MinimizatonAttempts, 219 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-20 05:47:45,055 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/list-ext-properties/list-ext.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 75539a96800eea0d91d3dad14f0ad356c5f8079fa4f6dcf5bbfcb193296a44a8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:47:46,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:47:46,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:47:46,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:47:46,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:47:46,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:47:46,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:47:46,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:47:46,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:47:46,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:47:46,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:47:46,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:47:46,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:47:46,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:47:46,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:47:46,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:47:46,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:47:46,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:47:46,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:47:46,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:47:46,655 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:47:46,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:47:46,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:47:46,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:47:46,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:47:46,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:47:46,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:47:46,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:47:46,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:47:46,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:47:46,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:47:46,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:47:46,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:47:46,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:47:46,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:47:46,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:47:46,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:47:46,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:47:46,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:47:46,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:47:46,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:47:46,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:47:46,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 05:47:46,703 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:47:46,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:47:46,704 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:47:46,704 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:47:46,704 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:47:46,705 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:47:46,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:47:46,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:47:46,705 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:47:46,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:47:46,706 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:47:46,706 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:47:46,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:47:46,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:47:46,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:47:46,707 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:47:46,707 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:47:46,708 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:47:46,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:47:46,708 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:47:46,708 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 05:47:46,708 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 05:47:46,708 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:47:46,709 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:47:46,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:47:46,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:47:46,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:47:46,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:47:46,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:47:46,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:47:46,710 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 05:47:46,710 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 05:47:46,710 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 05:47:46,710 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 75539a96800eea0d91d3dad14f0ad356c5f8079fa4f6dcf5bbfcb193296a44a8 [2022-07-20 05:47:47,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:47:47,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:47:47,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:47:47,052 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:47:47,052 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:47:47,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext.i [2022-07-20 05:47:47,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7081d7140/64017b9e6e334e2491c1796a3baede22/FLAG056eafd49 [2022-07-20 05:47:47,542 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:47:47,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext.i [2022-07-20 05:47:47,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7081d7140/64017b9e6e334e2491c1796a3baede22/FLAG056eafd49 [2022-07-20 05:47:47,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7081d7140/64017b9e6e334e2491c1796a3baede22 [2022-07-20 05:47:47,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:47:47,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:47:47,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:47:47,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:47:47,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:47:47,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:47:47" (1/1) ... [2022-07-20 05:47:47,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b12118d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:47, skipping insertion in model container [2022-07-20 05:47:47,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:47:47" (1/1) ... [2022-07-20 05:47:47,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:47:47,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:47:48,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext.i[23551,23564] [2022-07-20 05:47:48,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:47:48,139 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:47:48,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext.i[23551,23564] [2022-07-20 05:47:48,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:47:48,219 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:47:48,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:48 WrapperNode [2022-07-20 05:47:48,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:47:48,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:47:48,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:47:48,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:47:48,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:48" (1/1) ... [2022-07-20 05:47:48,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:48" (1/1) ... [2022-07-20 05:47:48,258 INFO L137 Inliner]: procedures = 127, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2022-07-20 05:47:48,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:47:48,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:47:48,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:47:48,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:47:48,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:48" (1/1) ... [2022-07-20 05:47:48,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:48" (1/1) ... [2022-07-20 05:47:48,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:48" (1/1) ... [2022-07-20 05:47:48,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:48" (1/1) ... [2022-07-20 05:47:48,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:48" (1/1) ... [2022-07-20 05:47:48,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:48" (1/1) ... [2022-07-20 05:47:48,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:48" (1/1) ... [2022-07-20 05:47:48,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:47:48,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:47:48,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:47:48,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:47:48,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:48" (1/1) ... [2022-07-20 05:47:48,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:47:48,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:48,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 05:47:48,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 05:47:48,378 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-20 05:47:48,378 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-20 05:47:48,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 05:47:48,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:47:48,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:47:48,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:47:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:47:48,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:47:48,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 05:47:48,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 05:47:48,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:47:48,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:47:48,466 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:47:48,467 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:47:48,527 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-20 05:47:48,858 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:47:48,862 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:47:48,863 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-20 05:47:48,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:47:48 BoogieIcfgContainer [2022-07-20 05:47:48,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:47:48,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:47:48,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:47:48,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:47:48,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:47:47" (1/3) ... [2022-07-20 05:47:48,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15912e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:47:48, skipping insertion in model container [2022-07-20 05:47:48,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:48" (2/3) ... [2022-07-20 05:47:48,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15912e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:47:48, skipping insertion in model container [2022-07-20 05:47:48,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:47:48" (3/3) ... [2022-07-20 05:47:48,869 INFO L111 eAbstractionObserver]: Analyzing ICFG list-ext.i [2022-07-20 05:47:48,878 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:47:48,878 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-07-20 05:47:48,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:47:48,916 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@33002020, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6d51de26 [2022-07-20 05:47:48,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-07-20 05:47:48,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 47 states have (on average 2.106382978723404) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:47:48,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:48,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:47:48,925 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:48,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516551, now seen corresponding path program 1 times [2022-07-20 05:47:48,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:47:48,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356543930] [2022-07-20 05:47:48,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:48,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:47:48,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:47:48,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:47:48,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 05:47:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:48,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:47:48,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:49,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:47:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:49,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:47:49,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:47:49,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356543930] [2022-07-20 05:47:49,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356543930] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:49,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:49,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:47:49,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646382464] [2022-07-20 05:47:49,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:49,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:47:49,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:47:49,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:47:49,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:47:49,082 INFO L87 Difference]: Start difference. First operand has 89 states, 47 states have (on average 2.106382978723404) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:49,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:49,296 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-07-20 05:47:49,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:47:49,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 05:47:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:49,302 INFO L225 Difference]: With dead ends: 106 [2022-07-20 05:47:49,302 INFO L226 Difference]: Without dead ends: 99 [2022-07-20 05:47:49,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:47:49,307 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 149 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:49,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 55 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:47:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-20 05:47:49,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2022-07-20 05:47:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.75) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2022-07-20 05:47:49,340 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 6 [2022-07-20 05:47:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:49,341 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2022-07-20 05:47:49,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-07-20 05:47:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:47:49,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:49,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:47:49,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-20 05:47:49,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:47:49,548 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:49,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:49,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516552, now seen corresponding path program 1 times [2022-07-20 05:47:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:47:49,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129887552] [2022-07-20 05:47:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:49,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:47:49,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:47:49,560 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:47:49,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 05:47:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:49,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:47:49,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:49,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:47:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:49,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:47:49,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:47:49,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129887552] [2022-07-20 05:47:49,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129887552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:49,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:49,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:47:49,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51525847] [2022-07-20 05:47:49,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:49,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:47:49,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:47:49,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:47:49,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:47:49,673 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:49,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:49,886 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-07-20 05:47:49,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:47:49,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 05:47:49,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:49,888 INFO L225 Difference]: With dead ends: 116 [2022-07-20 05:47:49,888 INFO L226 Difference]: Without dead ends: 116 [2022-07-20 05:47:49,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:47:49,889 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 151 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:49,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 48 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:47:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-20 05:47:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2022-07-20 05:47:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 98 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2022-07-20 05:47:49,895 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 6 [2022-07-20 05:47:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:49,895 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2022-07-20 05:47:49,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:49,895 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2022-07-20 05:47:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:47:49,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:49,896 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:49,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:50,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:47:50,097 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:50,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769667, now seen corresponding path program 1 times [2022-07-20 05:47:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:47:50,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378467535] [2022-07-20 05:47:50,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:50,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:47:50,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:47:50,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:47:50,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 05:47:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:50,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:47:50,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:50,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:47:50,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:47:50,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 05:47:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:50,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:47:50,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:47:50,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378467535] [2022-07-20 05:47:50,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378467535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:50,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:50,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:47:50,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182221361] [2022-07-20 05:47:50,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:50,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:50,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:47:50,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:50,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:50,266 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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) [2022-07-20 05:47:50,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:50,609 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2022-07-20 05:47:50,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:47:50,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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 [2022-07-20 05:47:50,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:50,610 INFO L225 Difference]: With dead ends: 142 [2022-07-20 05:47:50,610 INFO L226 Difference]: Without dead ends: 142 [2022-07-20 05:47:50,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:47:50,611 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 105 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:50,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 180 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:47:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-20 05:47:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 101. [2022-07-20 05:47:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.52) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:50,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2022-07-20 05:47:50,618 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 13 [2022-07-20 05:47:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:50,618 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2022-07-20 05:47:50,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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) [2022-07-20 05:47:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2022-07-20 05:47:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:47:50,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:50,618 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:50,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:50,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:47:50,826 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:50,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:50,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769666, now seen corresponding path program 1 times [2022-07-20 05:47:50,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:47:50,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392441500] [2022-07-20 05:47:50,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:50,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:47:50,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:47:50,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:47:50,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 05:47:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:50,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:47:50,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:50,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:47:50,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:47:50,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:47:50,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 05:47:50,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 05:47:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:51,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:47:51,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:47:51,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392441500] [2022-07-20 05:47:51,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392441500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:51,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:51,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:47:51,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077458594] [2022-07-20 05:47:51,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:51,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:51,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:47:51,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:51,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:51,032 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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) [2022-07-20 05:47:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:51,626 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2022-07-20 05:47:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:47:51,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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 [2022-07-20 05:47:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:51,630 INFO L225 Difference]: With dead ends: 145 [2022-07-20 05:47:51,630 INFO L226 Difference]: Without dead ends: 145 [2022-07-20 05:47:51,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:47:51,633 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 69 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:51,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 247 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 05:47:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-20 05:47:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 89. [2022-07-20 05:47:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 88 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2022-07-20 05:47:51,647 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 13 [2022-07-20 05:47:51,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:51,649 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2022-07-20 05:47:51,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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) [2022-07-20 05:47:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-07-20 05:47:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 05:47:51,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:51,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:51,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:51,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:47:51,852 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:51,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:51,852 INFO L85 PathProgramCache]: Analyzing trace with hash 174166817, now seen corresponding path program 1 times [2022-07-20 05:47:51,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:47:51,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356523216] [2022-07-20 05:47:51,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:51,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:47:51,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:47:51,855 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:47:51,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 05:47:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:51,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:47:51,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:51,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:47:51,992 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 05:47:51,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:47:52,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:47:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:52,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:47:52,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:47:52,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356523216] [2022-07-20 05:47:52,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356523216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:52,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:52,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:47:52,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763332654] [2022-07-20 05:47:52,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:52,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:47:52,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:47:52,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:47:52,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:47:52,024 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:52,299 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2022-07-20 05:47:52,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:47:52,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 14 [2022-07-20 05:47:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:52,300 INFO L225 Difference]: With dead ends: 177 [2022-07-20 05:47:52,301 INFO L226 Difference]: Without dead ends: 177 [2022-07-20 05:47:52,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:47:52,301 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 116 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:52,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 195 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:47:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-20 05:47:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 96. [2022-07-20 05:47:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 95 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2022-07-20 05:47:52,305 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 14 [2022-07-20 05:47:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:52,305 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2022-07-20 05:47:52,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2022-07-20 05:47:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 05:47:52,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:52,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:52,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:52,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:47:52,513 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:52,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:52,513 INFO L85 PathProgramCache]: Analyzing trace with hash 916718725, now seen corresponding path program 1 times [2022-07-20 05:47:52,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:47:52,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493092667] [2022-07-20 05:47:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:52,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:47:52,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:47:52,515 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:47:52,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 05:47:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:52,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:47:52,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:52,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:47:52,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:47:52,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 05:47:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:52,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:47:52,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:47:52,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493092667] [2022-07-20 05:47:52,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493092667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:52,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:52,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:47:52,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906091270] [2022-07-20 05:47:52,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:52,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:52,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:47:52,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:52,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:52,618 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:52,871 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2022-07-20 05:47:52,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:47:52,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2022-07-20 05:47:52,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:52,872 INFO L225 Difference]: With dead ends: 124 [2022-07-20 05:47:52,872 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 05:47:52,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:47:52,872 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 98 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:52,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 161 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:47:52,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 05:47:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. [2022-07-20 05:47:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 93 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:52,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2022-07-20 05:47:52,875 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 14 [2022-07-20 05:47:52,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:52,876 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2022-07-20 05:47:52,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2022-07-20 05:47:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 05:47:52,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:52,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:52,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:53,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:47:53,077 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:53,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:53,077 INFO L85 PathProgramCache]: Analyzing trace with hash 916718726, now seen corresponding path program 1 times [2022-07-20 05:47:53,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:47:53,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89965421] [2022-07-20 05:47:53,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:53,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:47:53,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:47:53,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:47:53,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 05:47:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:53,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:47:53,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:53,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:47:53,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:47:53,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:47:53,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 05:47:53,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 05:47:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:53,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:47:53,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:47:53,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89965421] [2022-07-20 05:47:53,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89965421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:53,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:53,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:47:53,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71595376] [2022-07-20 05:47:53,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:53,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:53,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:47:53,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:53,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:53,225 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:53,615 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2022-07-20 05:47:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:47:53,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2022-07-20 05:47:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:53,616 INFO L225 Difference]: With dead ends: 122 [2022-07-20 05:47:53,616 INFO L226 Difference]: Without dead ends: 122 [2022-07-20 05:47:53,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:47:53,617 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 61 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:53,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 221 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:47:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-20 05:47:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 81. [2022-07-20 05:47:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.4) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2022-07-20 05:47:53,619 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 14 [2022-07-20 05:47:53,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:53,619 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2022-07-20 05:47:53,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2022-07-20 05:47:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:47:53,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:53,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:53,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:53,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:47:53,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:53,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:53,828 INFO L85 PathProgramCache]: Analyzing trace with hash -177044285, now seen corresponding path program 1 times [2022-07-20 05:47:53,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:47:53,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314458426] [2022-07-20 05:47:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:53,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:47:53,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:47:53,830 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:47:53,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 05:47:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:47:53,905 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 05:47:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:47:53,964 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-20 05:47:53,964 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 05:47:53,965 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2022-07-20 05:47:53,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2022-07-20 05:47:53,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2022-07-20 05:47:53,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2022-07-20 05:47:53,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2022-07-20 05:47:53,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2022-07-20 05:47:53,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2022-07-20 05:47:53,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2022-07-20 05:47:53,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2022-07-20 05:47:53,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2022-07-20 05:47:53,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2022-07-20 05:47:53,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2022-07-20 05:47:53,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2022-07-20 05:47:53,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2022-07-20 05:47:53,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2022-07-20 05:47:53,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2022-07-20 05:47:53,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2022-07-20 05:47:53,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2022-07-20 05:47:53,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2022-07-20 05:47:53,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2022-07-20 05:47:53,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2022-07-20 05:47:53,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2022-07-20 05:47:53,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2022-07-20 05:47:53,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2022-07-20 05:47:53,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2022-07-20 05:47:53,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2022-07-20 05:47:53,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2022-07-20 05:47:53,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2022-07-20 05:47:53,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2022-07-20 05:47:53,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2022-07-20 05:47:53,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2022-07-20 05:47:53,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (6 of 38 remaining) [2022-07-20 05:47:53,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (5 of 38 remaining) [2022-07-20 05:47:53,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (4 of 38 remaining) [2022-07-20 05:47:53,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (3 of 38 remaining) [2022-07-20 05:47:53,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (2 of 38 remaining) [2022-07-20 05:47:53,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (1 of 38 remaining) [2022-07-20 05:47:53,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2022-07-20 05:47:54,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:54,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:47:54,174 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:54,176 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 05:47:54,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:47:54 BoogieIcfgContainer [2022-07-20 05:47:54,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 05:47:54,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 05:47:54,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 05:47:54,192 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 05:47:54,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:47:48" (3/4) ... [2022-07-20 05:47:54,193 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 05:47:54,194 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 05:47:54,194 INFO L158 Benchmark]: Toolchain (without parser) took 6352.58ms. Allocated memory was 65.0MB in the beginning and 113.2MB in the end (delta: 48.2MB). Free memory was 45.1MB in the beginning and 83.9MB in the end (delta: -38.8MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2022-07-20 05:47:54,194 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 65.0MB. Free memory was 47.7MB in the beginning and 47.6MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:47:54,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.51ms. Allocated memory is still 65.0MB. Free memory was 44.9MB in the beginning and 41.2MB in the end (delta: 3.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-20 05:47:54,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.65ms. Allocated memory is still 65.0MB. Free memory was 41.1MB in the beginning and 39.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:47:54,195 INFO L158 Benchmark]: Boogie Preprocessor took 32.96ms. Allocated memory is still 65.0MB. Free memory was 39.0MB in the beginning and 37.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:47:54,195 INFO L158 Benchmark]: RCFGBuilder took 571.30ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 37.0MB in the beginning and 57.6MB in the end (delta: -20.6MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2022-07-20 05:47:54,195 INFO L158 Benchmark]: TraceAbstraction took 5325.70ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 57.3MB in the beginning and 83.9MB in the end (delta: -26.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:47:54,195 INFO L158 Benchmark]: Witness Printer took 2.31ms. Allocated memory is still 113.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:47:54,196 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.18ms. Allocated memory is still 65.0MB. Free memory was 47.7MB in the beginning and 47.6MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.51ms. Allocated memory is still 65.0MB. Free memory was 44.9MB in the beginning and 41.2MB in the end (delta: 3.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.65ms. Allocated memory is still 65.0MB. Free memory was 41.1MB in the beginning and 39.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.96ms. Allocated memory is still 65.0MB. Free memory was 39.0MB in the beginning and 37.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 571.30ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 37.0MB in the beginning and 57.6MB in the end (delta: -20.6MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5325.70ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 57.3MB in the beginning and 83.9MB in the end (delta: -26.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.31ms. Allocated memory is still 113.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 568]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 568. Possible FailurePath: [L532] int i = 0; [L533] int y = 0; [L534] List a = (List) malloc(sizeof(struct node)); [L535] COND FALSE !(a == 0) VAL [a={6:0}, i=0, y=0] [L536] List t; [L537] List p = a; VAL [a={6:0}, i=0, p={6:0}, y=0] [L538] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L546] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L554] p->h = 3 VAL [a={6:0}, i=0, p={6:0}, y=0] [L555] p->n = 0 VAL [a={6:0}, i=0, p={6:0}, y=0] [L556] i = 0 [L557] y = 0 [L558] p = a VAL [a={6:0}, i=0, p={6:0}, y=0] [L559] EXPR p->h VAL [a={6:0}, i=0, p={6:0}, p->h=3, y=0] [L559] COND FALSE !(p->h == 1) [L563] EXPR p->h VAL [a={6:0}, i=0, p={6:0}, p->h=3, y=0] [L563] COND FALSE !(p->h == 2) [L567] EXPR p->h VAL [a={6:0}, i=0, p={6:0}, p->h=3, y=0] [L567] COND TRUE p->h != 3 || (i + y) < 20 [L568] reach_error() VAL [a={6:0}, i=0, p={6:0}, y=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 749 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 749 mSDsluCounter, 1107 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 711 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1450 IncrementalHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 396 mSDtfsCounter, 1450 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=3, InterpolantAutomatonStates: 46, 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, 7 MinimizatonAttempts, 286 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 346 SizeOfPredicates, 30 NumberOfNonLiveVariables, 443 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 7/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-20 05:47:54,231 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: UNKNOWN: Overapproximated counterexample