./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 a31fd051 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-?-a31fd05 [2023-02-15 13:01:05,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:01:05,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:01:05,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:01:05,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:01:05,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:01:05,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:01:05,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:01:05,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:01:05,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:01:05,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:01:05,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:01:05,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:01:05,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:01:05,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:01:05,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:01:05,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:01:05,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:01:05,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:01:05,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:01:05,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:01:05,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:01:05,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:01:05,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:01:05,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:01:05,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:01:05,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:01:05,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:01:05,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:01:05,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:01:05,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:01:05,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:01:05,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:01:05,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:01:05,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:01:05,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:01:05,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:01:05,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:01:05,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:01:05,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:01:05,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:01:05,261 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:01:05,294 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:01:05,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:01:05,295 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:01:05,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:01:05,296 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:01:05,296 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:01:05,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:01:05,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:01:05,297 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:01:05,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:01:05,298 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:01:05,298 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:01:05,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:01:05,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:01:05,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:01:05,299 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:01:05,299 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:01:05,299 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:01:05,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:01:05,299 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:01:05,299 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:01:05,299 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:01:05,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:01:05,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:01:05,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:01:05,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:01:05,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:01:05,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:01:05,301 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:01:05,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:01:05,301 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:01:05,301 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:01:05,302 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:01:05,302 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:01:05,302 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 75539a96800eea0d91d3dad14f0ad356c5f8079fa4f6dcf5bbfcb193296a44a8 [2023-02-15 13:01:05,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:01:05,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:01:05,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:01:05,538 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:01:05,539 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:01:05,540 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 [2023-02-15 13:01:06,627 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:01:06,936 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:01:06,939 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext.i [2023-02-15 13:01:06,954 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb1f36fb/8a296b69dbfe46569d71a89f01816ff9/FLAGd5f85b933 [2023-02-15 13:01:07,258 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb1f36fb/8a296b69dbfe46569d71a89f01816ff9 [2023-02-15 13:01:07,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:01:07,261 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:01:07,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:01:07,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:01:07,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:01:07,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:01:07" (1/1) ... [2023-02-15 13:01:07,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d520229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:07, skipping insertion in model container [2023-02-15 13:01:07,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:01:07" (1/1) ... [2023-02-15 13:01:07,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:01:07,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:01:07,746 WARN L237 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] [2023-02-15 13:01:07,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:01:07,767 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:01:07,790 WARN L237 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] [2023-02-15 13:01:07,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:01:07,841 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:01:07,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:07 WrapperNode [2023-02-15 13:01:07,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:01:07,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:01:07,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:01:07,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:01:07,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:07" (1/1) ... [2023-02-15 13:01:07,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:07" (1/1) ... [2023-02-15 13:01:07,937 INFO L138 Inliner]: procedures = 124, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 128 [2023-02-15 13:01:07,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:01:07,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:01:07,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:01:07,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:01:07,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:07" (1/1) ... [2023-02-15 13:01:07,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:07" (1/1) ... [2023-02-15 13:01:07,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:07" (1/1) ... [2023-02-15 13:01:07,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:07" (1/1) ... [2023-02-15 13:01:07,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:07" (1/1) ... [2023-02-15 13:01:07,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:07" (1/1) ... [2023-02-15 13:01:07,999 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:07" (1/1) ... [2023-02-15 13:01:08,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:07" (1/1) ... [2023-02-15 13:01:08,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:01:08,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:01:08,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:01:08,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:01:08,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:07" (1/1) ... [2023-02-15 13:01:08,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:01:08,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:01:08,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 13:01:08,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 13:01:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 13:01:08,109 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 13:01:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:01:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:01:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:01:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:01:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:01:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:01:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:01:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:01:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:01:08,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:01:08,177 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:01:08,178 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:01:08,209 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 13:01:08,488 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:01:08,492 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:01:08,493 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 13:01:08,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:01:08 BoogieIcfgContainer [2023-02-15 13:01:08,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:01:08,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:01:08,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:01:08,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:01:08,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:01:07" (1/3) ... [2023-02-15 13:01:08,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d18b50a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:01:08, skipping insertion in model container [2023-02-15 13:01:08,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:07" (2/3) ... [2023-02-15 13:01:08,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d18b50a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:01:08, skipping insertion in model container [2023-02-15 13:01:08,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:01:08" (3/3) ... [2023-02-15 13:01:08,500 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext.i [2023-02-15 13:01:08,513 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:01:08,513 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-02-15 13:01:08,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:01:08,553 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d6cff03, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:01:08,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-02-15 13:01:08,556 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) [2023-02-15 13:01:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 13:01:08,561 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:08,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:01:08,562 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)] === [2023-02-15 13:01:08,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2098269937, now seen corresponding path program 1 times [2023-02-15 13:01:08,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:01:08,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129240084] [2023-02-15 13:01:08,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:08,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:01:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:01:08,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:01:08,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129240084] [2023-02-15 13:01:08,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129240084] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:08,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:08,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:01:08,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040610263] [2023-02-15 13:01:08,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:08,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 13:01:08,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:01:08,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 13:01:08,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 13:01:08,747 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) [2023-02-15 13:01:08,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:08,762 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2023-02-15 13:01:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 13:01:08,764 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 [2023-02-15 13:01:08,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:08,768 INFO L225 Difference]: With dead ends: 93 [2023-02-15 13:01:08,769 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 13:01:08,770 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 [2023-02-15 13:01:08,772 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 [2023-02-15 13:01:08,773 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] [2023-02-15 13:01:08,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 13:01:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-15 13:01:08,795 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) [2023-02-15 13:01:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2023-02-15 13:01:08,797 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 7 [2023-02-15 13:01:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:08,798 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2023-02-15 13:01:08,798 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) [2023-02-15 13:01:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2023-02-15 13:01:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 13:01:08,799 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:08,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:01:08,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:01:08,799 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)] === [2023-02-15 13:01:08,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:08,800 INFO L85 PathProgramCache]: Analyzing trace with hash 620871786, now seen corresponding path program 1 times [2023-02-15 13:01:08,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:01:08,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989008252] [2023-02-15 13:01:08,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:08,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:01:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:01:08,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:01:08,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989008252] [2023-02-15 13:01:08,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989008252] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:08,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:08,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:01:08,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255962221] [2023-02-15 13:01:08,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:08,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:01:08,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:01:08,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:01:08,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:01:08,922 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) [2023-02-15 13:01:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:09,037 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2023-02-15 13:01:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:01:09,037 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 [2023-02-15 13:01:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:09,038 INFO L225 Difference]: With dead ends: 107 [2023-02-15 13:01:09,039 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 13:01:09,039 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 [2023-02-15 13:01:09,040 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 162 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:09,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 52 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:01:09,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 13:01:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2023-02-15 13:01:09,046 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) [2023-02-15 13:01:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2023-02-15 13:01:09,047 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 8 [2023-02-15 13:01:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:09,047 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2023-02-15 13:01:09,047 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) [2023-02-15 13:01:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2023-02-15 13:01:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 13:01:09,048 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:09,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:01:09,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:01:09,066 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)] === [2023-02-15 13:01:09,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash 620871787, now seen corresponding path program 1 times [2023-02-15 13:01:09,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:01:09,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855496732] [2023-02-15 13:01:09,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:09,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:01:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:01:09,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:01:09,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855496732] [2023-02-15 13:01:09,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855496732] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:09,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:09,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:01:09,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311316380] [2023-02-15 13:01:09,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:09,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:01:09,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:01:09,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:01:09,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:01:09,226 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) [2023-02-15 13:01:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:09,375 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2023-02-15 13:01:09,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:01:09,376 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 [2023-02-15 13:01:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:09,380 INFO L225 Difference]: With dead ends: 124 [2023-02-15 13:01:09,380 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 13:01:09,384 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 [2023-02-15 13:01:09,386 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 170 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:09,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 60 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:01:09,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 13:01:09,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2023-02-15 13:01:09,394 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) [2023-02-15 13:01:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2023-02-15 13:01:09,395 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 8 [2023-02-15 13:01:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:09,395 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2023-02-15 13:01:09,396 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) [2023-02-15 13:01:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2023-02-15 13:01:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:01:09,396 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:09,397 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:01:09,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:01:09,397 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)] === [2023-02-15 13:01:09,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:09,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204644, now seen corresponding path program 1 times [2023-02-15 13:01:09,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:01:09,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300324529] [2023-02-15 13:01:09,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:09,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:01:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:01:09,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:01:09,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300324529] [2023-02-15 13:01:09,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300324529] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:09,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:09,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:01:09,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383380717] [2023-02-15 13:01:09,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:09,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:01:09,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:01:09,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:01:09,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:01:09,564 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) [2023-02-15 13:01:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:09,746 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2023-02-15 13:01:09,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:01:09,746 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 [2023-02-15 13:01:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:09,747 INFO L225 Difference]: With dead ends: 152 [2023-02-15 13:01:09,747 INFO L226 Difference]: Without dead ends: 152 [2023-02-15 13:01:09,748 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 [2023-02-15 13:01:09,748 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 116 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:09,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 240 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:01:09,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-15 13:01:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 111. [2023-02-15 13:01:09,753 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) [2023-02-15 13:01:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2023-02-15 13:01:09,754 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 17 [2023-02-15 13:01:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:09,754 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2023-02-15 13:01:09,754 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) [2023-02-15 13:01:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2023-02-15 13:01:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:01:09,755 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:09,755 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:01:09,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:01:09,756 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)] === [2023-02-15 13:01:09,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:09,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204645, now seen corresponding path program 1 times [2023-02-15 13:01:09,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:01:09,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229004690] [2023-02-15 13:01:09,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:09,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:01:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:01:09,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:01:09,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229004690] [2023-02-15 13:01:09,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229004690] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:09,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:09,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:01:09,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877403134] [2023-02-15 13:01:09,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:09,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:01:09,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:01:09,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:01:09,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:01:09,913 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) [2023-02-15 13:01:10,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:10,142 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2023-02-15 13:01:10,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:01:10,142 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 [2023-02-15 13:01:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:10,143 INFO L225 Difference]: With dead ends: 155 [2023-02-15 13:01:10,143 INFO L226 Difference]: Without dead ends: 155 [2023-02-15 13:01:10,143 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 [2023-02-15 13:01:10,144 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 80 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:10,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 307 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:01:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-15 13:01:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 95. [2023-02-15 13:01:10,148 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) [2023-02-15 13:01:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2023-02-15 13:01:10,148 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 17 [2023-02-15 13:01:10,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:10,149 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2023-02-15 13:01:10,149 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) [2023-02-15 13:01:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2023-02-15 13:01:10,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 13:01:10,150 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:10,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:01:10,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:01:10,150 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)] === [2023-02-15 13:01:10,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:10,151 INFO L85 PathProgramCache]: Analyzing trace with hash -808483032, now seen corresponding path program 1 times [2023-02-15 13:01:10,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:01:10,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557312177] [2023-02-15 13:01:10,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:10,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:01:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:01:10,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:01:10,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557312177] [2023-02-15 13:01:10,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557312177] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:10,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:10,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:01:10,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640549068] [2023-02-15 13:01:10,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:10,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:01:10,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:01:10,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:01:10,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:01:10,248 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) [2023-02-15 13:01:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:10,373 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2023-02-15 13:01:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:01:10,374 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 [2023-02-15 13:01:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:10,375 INFO L225 Difference]: With dead ends: 187 [2023-02-15 13:01:10,375 INFO L226 Difference]: Without dead ends: 187 [2023-02-15 13:01:10,375 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 [2023-02-15 13:01:10,377 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 121 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:10,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 231 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:01:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-15 13:01:10,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 106. [2023-02-15 13:01:10,383 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) [2023-02-15 13:01:10,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2023-02-15 13:01:10,384 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 18 [2023-02-15 13:01:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:10,384 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2023-02-15 13:01:10,384 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) [2023-02-15 13:01:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2023-02-15 13:01:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 13:01:10,385 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:10,385 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] [2023-02-15 13:01:10,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:01:10,385 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)] === [2023-02-15 13:01:10,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash 389256394, now seen corresponding path program 1 times [2023-02-15 13:01:10,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:01:10,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797399684] [2023-02-15 13:01:10,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:10,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:01:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:01:10,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 13:01:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:01:10,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 13:01:10,510 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 13:01:10,511 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2023-02-15 13:01:10,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2023-02-15 13:01:10,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2023-02-15 13:01:10,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2023-02-15 13:01:10,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2023-02-15 13:01:10,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2023-02-15 13:01:10,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2023-02-15 13:01:10,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2023-02-15 13:01:10,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2023-02-15 13:01:10,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2023-02-15 13:01:10,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2023-02-15 13:01:10,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2023-02-15 13:01:10,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2023-02-15 13:01:10,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2023-02-15 13:01:10,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2023-02-15 13:01:10,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2023-02-15 13:01:10,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2023-02-15 13:01:10,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2023-02-15 13:01:10,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2023-02-15 13:01:10,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2023-02-15 13:01:10,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2023-02-15 13:01:10,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2023-02-15 13:01:10,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2023-02-15 13:01:10,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2023-02-15 13:01:10,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2023-02-15 13:01:10,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2023-02-15 13:01:10,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2023-02-15 13:01:10,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2023-02-15 13:01:10,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2023-02-15 13:01:10,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2023-02-15 13:01:10,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2023-02-15 13:01:10,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (6 of 38 remaining) [2023-02-15 13:01:10,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (5 of 38 remaining) [2023-02-15 13:01:10,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (4 of 38 remaining) [2023-02-15 13:01:10,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (3 of 38 remaining) [2023-02-15 13:01:10,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (2 of 38 remaining) [2023-02-15 13:01:10,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (1 of 38 remaining) [2023-02-15 13:01:10,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2023-02-15 13:01:10,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 13:01:10,522 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:01:10,534 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:01:10,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:01:10 BoogieIcfgContainer [2023-02-15 13:01:10,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:01:10,552 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:01:10,552 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:01:10,552 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:01:10,553 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:01:08" (3/4) ... [2023-02-15 13:01:10,555 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 13:01:10,555 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:01:10,555 INFO L158 Benchmark]: Toolchain (without parser) took 3294.01ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 100.2MB in the beginning and 140.3MB in the end (delta: -40.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2023-02-15 13:01:10,555 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:01:10,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.32ms. Allocated memory is still 138.4MB. Free memory was 100.2MB in the beginning and 83.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 13:01:10,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.07ms. Allocated memory is still 138.4MB. Free memory was 83.1MB in the beginning and 81.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:01:10,556 INFO L158 Benchmark]: Boogie Preprocessor took 78.64ms. Allocated memory is still 138.4MB. Free memory was 81.0MB in the beginning and 79.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:01:10,556 INFO L158 Benchmark]: RCFGBuilder took 471.40ms. Allocated memory is still 138.4MB. Free memory was 79.1MB in the beginning and 58.9MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-15 13:01:10,557 INFO L158 Benchmark]: TraceAbstraction took 2055.69ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 58.2MB in the beginning and 140.3MB in the end (delta: -82.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:01:10,557 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 188.7MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:01:10,558 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.19ms. Allocated memory is still 138.4MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 581.32ms. Allocated memory is still 138.4MB. Free memory was 100.2MB in the beginning and 83.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.07ms. Allocated memory is still 138.4MB. Free memory was 83.1MB in the beginning and 81.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.64ms. Allocated memory is still 138.4MB. Free memory was 81.0MB in the beginning and 79.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 471.40ms. Allocated memory is still 138.4MB. Free memory was 79.1MB in the beginning and 58.9MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2055.69ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 58.2MB in the beginning and 140.3MB in the end (delta: -82.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 188.7MB. Free memory is still 140.3MB. 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: 2.0s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 649 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 649 mSDsluCounter, 992 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 587 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 972 IncrementalHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 219 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 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 [2023-02-15 13:01:10,576 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-?-a31fd05 [2023-02-15 13:01:12,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:01:12,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:01:12,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:01:12,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:01:12,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:01:12,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:01:12,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:01:12,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:01:12,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:01:12,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:01:12,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:01:12,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:01:12,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:01:12,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:01:12,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:01:12,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:01:12,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:01:12,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:01:12,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:01:12,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:01:12,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:01:12,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:01:12,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:01:12,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:01:12,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:01:12,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:01:12,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:01:12,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:01:12,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:01:12,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:01:12,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:01:12,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:01:12,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:01:12,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:01:12,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:01:12,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:01:12,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:01:12,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:01:12,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:01:12,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:01:12,910 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 13:01:12,924 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:01:12,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:01:12,925 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:01:12,925 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:01:12,925 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:01:12,926 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:01:12,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:01:12,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:01:12,926 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:01:12,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:01:12,927 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:01:12,927 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:01:12,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:01:12,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:01:12,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:01:12,928 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:01:12,928 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:01:12,928 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:01:12,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:01:12,929 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:01:12,929 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 13:01:12,929 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 13:01:12,929 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:01:12,929 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:01:12,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:01:12,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:01:12,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:01:12,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:01:12,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:01:12,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:01:12,930 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 13:01:12,930 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 13:01:12,931 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:01:12,931 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:01:12,931 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:01:12,931 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 13:01:12,931 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:01:12,931 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 75539a96800eea0d91d3dad14f0ad356c5f8079fa4f6dcf5bbfcb193296a44a8 [2023-02-15 13:01:13,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:01:13,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:01:13,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:01:13,265 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:01:13,266 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:01:13,267 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 [2023-02-15 13:01:14,379 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:01:14,622 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:01:14,623 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext.i [2023-02-15 13:01:14,631 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba62b55cb/e3a242e9055b45b9a949287fb10cc371/FLAGdee8593b4 [2023-02-15 13:01:14,644 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba62b55cb/e3a242e9055b45b9a949287fb10cc371 [2023-02-15 13:01:14,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:01:14,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:01:14,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:01:14,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:01:14,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:01:14,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:01:14" (1/1) ... [2023-02-15 13:01:14,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0f3a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:14, skipping insertion in model container [2023-02-15 13:01:14,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:01:14" (1/1) ... [2023-02-15 13:01:14,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:01:14,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:01:14,951 WARN L237 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] [2023-02-15 13:01:14,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:01:14,971 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:01:15,010 WARN L237 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] [2023-02-15 13:01:15,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:01:15,046 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:01:15,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:15 WrapperNode [2023-02-15 13:01:15,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:01:15,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:01:15,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:01:15,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:01:15,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:15" (1/1) ... [2023-02-15 13:01:15,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:15" (1/1) ... [2023-02-15 13:01:15,105 INFO L138 Inliner]: procedures = 127, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2023-02-15 13:01:15,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:01:15,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:01:15,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:01:15,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:01:15,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:15" (1/1) ... [2023-02-15 13:01:15,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:15" (1/1) ... [2023-02-15 13:01:15,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:15" (1/1) ... [2023-02-15 13:01:15,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:15" (1/1) ... [2023-02-15 13:01:15,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:15" (1/1) ... [2023-02-15 13:01:15,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:15" (1/1) ... [2023-02-15 13:01:15,145 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:15" (1/1) ... [2023-02-15 13:01:15,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:15" (1/1) ... [2023-02-15 13:01:15,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:01:15,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:01:15,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:01:15,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:01:15,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:15" (1/1) ... [2023-02-15 13:01:15,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:01:15,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:01:15,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 13:01:15,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 13:01:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 13:01:15,207 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 13:01:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 13:01:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:01:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:01:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:01:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:01:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:01:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 13:01:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 13:01:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:01:15,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:01:15,284 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:01:15,286 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:01:15,327 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 13:01:15,634 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:01:15,639 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:01:15,639 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 13:01:15,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:01:15 BoogieIcfgContainer [2023-02-15 13:01:15,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:01:15,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:01:15,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:01:15,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:01:15,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:01:14" (1/3) ... [2023-02-15 13:01:15,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55806f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:01:15, skipping insertion in model container [2023-02-15 13:01:15,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:15" (2/3) ... [2023-02-15 13:01:15,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55806f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:01:15, skipping insertion in model container [2023-02-15 13:01:15,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:01:15" (3/3) ... [2023-02-15 13:01:15,650 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext.i [2023-02-15 13:01:15,661 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:01:15,662 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-02-15 13:01:15,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:01:15,707 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@377deaa2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:01:15,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-02-15 13:01:15,711 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) [2023-02-15 13:01:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:01:15,715 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:15,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:01:15,717 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)] === [2023-02-15 13:01:15,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:15,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516551, now seen corresponding path program 1 times [2023-02-15 13:01:15,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:01:15,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179557806] [2023-02-15 13:01:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:15,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:15,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:01:15,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:01:15,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 13:01:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:15,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:01:15,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:01:15,896 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 13:01:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:01:15,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:01:15,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:01:15,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179557806] [2023-02-15 13:01:15,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179557806] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:15,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:15,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:01:15,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761592980] [2023-02-15 13:01:15,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:15,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:01:15,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:01:15,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:01:15,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:01:15,973 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) [2023-02-15 13:01:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:16,196 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2023-02-15 13:01:16,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:01:16,198 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 [2023-02-15 13:01:16,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:16,202 INFO L225 Difference]: With dead ends: 106 [2023-02-15 13:01:16,202 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 13:01:16,203 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 [2023-02-15 13:01:16,205 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 151 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:16,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 55 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:01:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 13:01:16,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2023-02-15 13:01:16,225 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) [2023-02-15 13:01:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2023-02-15 13:01:16,227 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 6 [2023-02-15 13:01:16,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:16,228 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2023-02-15 13:01:16,228 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) [2023-02-15 13:01:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2023-02-15 13:01:16,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:01:16,228 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:16,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:01:16,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 13:01:16,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:16,436 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)] === [2023-02-15 13:01:16,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516552, now seen corresponding path program 1 times [2023-02-15 13:01:16,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:01:16,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112633382] [2023-02-15 13:01:16,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:16,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:16,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:01:16,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:01:16,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 13:01:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:16,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 13:01:16,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:01:16,517 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:01:16,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:01:16,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:01:16,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112633382] [2023-02-15 13:01:16,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112633382] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:16,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:16,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:01:16,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055099322] [2023-02-15 13:01:16,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:16,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:01:16,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:01:16,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:01:16,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:01:16,566 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) [2023-02-15 13:01:16,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:16,827 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-02-15 13:01:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:01:16,827 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 [2023-02-15 13:01:16,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:16,828 INFO L225 Difference]: With dead ends: 116 [2023-02-15 13:01:16,828 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 13:01:16,829 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 [2023-02-15 13:01:16,829 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 154 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:16,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 48 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:01:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 13:01:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2023-02-15 13:01:16,834 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) [2023-02-15 13:01:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2023-02-15 13:01:16,835 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 6 [2023-02-15 13:01:16,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:16,835 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2023-02-15 13:01:16,835 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) [2023-02-15 13:01:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2023-02-15 13:01:16,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 13:01:16,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:16,836 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:01:16,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 13:01:17,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:17,037 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)] === [2023-02-15 13:01:17,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:17,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769667, now seen corresponding path program 1 times [2023-02-15 13:01:17,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:01:17,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958222748] [2023-02-15 13:01:17,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:17,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:17,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:01:17,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:01:17,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 13:01:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:17,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:01:17,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:01:17,099 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 13:01:17,112 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:17,124 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-02-15 13:01:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:01:17,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:01:17,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:01:17,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958222748] [2023-02-15 13:01:17,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958222748] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:17,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:17,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:01:17,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255127313] [2023-02-15 13:01:17,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:17,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:01:17,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:01:17,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:01:17,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:01:17,140 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) [2023-02-15 13:01:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:17,495 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2023-02-15 13:01:17,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:01:17,495 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 [2023-02-15 13:01:17,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:17,496 INFO L225 Difference]: With dead ends: 142 [2023-02-15 13:01:17,496 INFO L226 Difference]: Without dead ends: 142 [2023-02-15 13:01:17,497 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 [2023-02-15 13:01:17,497 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 106 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:17,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 180 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:01:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-15 13:01:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 101. [2023-02-15 13:01:17,501 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) [2023-02-15 13:01:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2023-02-15 13:01:17,502 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 13 [2023-02-15 13:01:17,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:17,502 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2023-02-15 13:01:17,502 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) [2023-02-15 13:01:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2023-02-15 13:01:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 13:01:17,503 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:17,503 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:01:17,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 13:01:17,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:17,710 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)] === [2023-02-15 13:01:17,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769666, now seen corresponding path program 1 times [2023-02-15 13:01:17,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:01:17,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374037121] [2023-02-15 13:01:17,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:17,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:17,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:01:17,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:01:17,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 13:01:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:17,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:01:17,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:01:17,838 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:17,869 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:17,909 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:17,940 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:17,946 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:01:17,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:01:17,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:01:17,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374037121] [2023-02-15 13:01:17,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374037121] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:17,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:17,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:01:17,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420890256] [2023-02-15 13:01:17,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:17,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:01:17,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:01:17,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:01:17,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:01:17,986 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) [2023-02-15 13:01:18,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:18,692 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2023-02-15 13:01:18,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:01:18,693 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 [2023-02-15 13:01:18,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:18,694 INFO L225 Difference]: With dead ends: 145 [2023-02-15 13:01:18,694 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 13:01:18,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:01:18,695 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 70 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:18,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 247 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 13:01:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 13:01:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 89. [2023-02-15 13:01:18,698 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) [2023-02-15 13:01:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2023-02-15 13:01:18,699 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 13 [2023-02-15 13:01:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:18,699 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2023-02-15 13:01:18,699 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) [2023-02-15 13:01:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2023-02-15 13:01:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 13:01:18,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:18,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:01:18,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:01:18,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:18,900 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)] === [2023-02-15 13:01:18,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:18,901 INFO L85 PathProgramCache]: Analyzing trace with hash 174166817, now seen corresponding path program 1 times [2023-02-15 13:01:18,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:01:18,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583047540] [2023-02-15 13:01:18,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:18,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:18,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:01:18,908 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:01:18,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 13:01:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:18,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 13:01:18,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:01:18,996 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:19,014 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:01:19,033 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:01:19,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:01:19,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:01:19,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583047540] [2023-02-15 13:01:19,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583047540] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:19,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:19,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:01:19,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970888096] [2023-02-15 13:01:19,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:19,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:01:19,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:01:19,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:01:19,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:01:19,042 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) [2023-02-15 13:01:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:19,333 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2023-02-15 13:01:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:01:19,334 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 [2023-02-15 13:01:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:19,335 INFO L225 Difference]: With dead ends: 177 [2023-02-15 13:01:19,335 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 13:01:19,335 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 [2023-02-15 13:01:19,335 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 119 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:19,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 195 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:01:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 13:01:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 96. [2023-02-15 13:01:19,339 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) [2023-02-15 13:01:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2023-02-15 13:01:19,340 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 14 [2023-02-15 13:01:19,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:19,340 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2023-02-15 13:01:19,340 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) [2023-02-15 13:01:19,340 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2023-02-15 13:01:19,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 13:01:19,341 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:19,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:01:19,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:01:19,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:19,557 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)] === [2023-02-15 13:01:19,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash 916718725, now seen corresponding path program 1 times [2023-02-15 13:01:19,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:01:19,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577301707] [2023-02-15 13:01:19,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:19,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:19,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:01:19,561 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:01:19,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 13:01:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:19,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:01:19,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:01:19,618 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 13:01:19,631 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:19,641 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-02-15 13:01:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:01:19,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:01:19,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:01:19,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577301707] [2023-02-15 13:01:19,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577301707] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:19,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:19,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:01:19,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009726813] [2023-02-15 13:01:19,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:19,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:01:19,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:01:19,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:01:19,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:01:19,660 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) [2023-02-15 13:01:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:19,936 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2023-02-15 13:01:19,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:01:19,936 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 [2023-02-15 13:01:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:19,937 INFO L225 Difference]: With dead ends: 124 [2023-02-15 13:01:19,937 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 13:01:19,937 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 [2023-02-15 13:01:19,938 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 99 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:19,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 161 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:01:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 13:01:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. [2023-02-15 13:01:19,941 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) [2023-02-15 13:01:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2023-02-15 13:01:19,942 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 14 [2023-02-15 13:01:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:19,942 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2023-02-15 13:01:19,942 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) [2023-02-15 13:01:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2023-02-15 13:01:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 13:01:19,942 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:19,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:01:19,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:01:20,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:20,150 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)] === [2023-02-15 13:01:20,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:20,150 INFO L85 PathProgramCache]: Analyzing trace with hash 916718726, now seen corresponding path program 1 times [2023-02-15 13:01:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:01:20,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188737227] [2023-02-15 13:01:20,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:20,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:20,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:01:20,155 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:01:20,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 13:01:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:20,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:01:20,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:01:20,232 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:20,259 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:20,265 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:20,285 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:20,289 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:01:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:01:20,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:01:20,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:01:20,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188737227] [2023-02-15 13:01:20,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188737227] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:20,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:20,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:01:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785368378] [2023-02-15 13:01:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:20,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:01:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:01:20,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:01:20,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:01:20,315 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) [2023-02-15 13:01:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:20,702 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2023-02-15 13:01:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:01:20,703 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 [2023-02-15 13:01:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:20,703 INFO L225 Difference]: With dead ends: 122 [2023-02-15 13:01:20,703 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 13:01:20,703 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 [2023-02-15 13:01:20,704 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:20,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 221 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:01:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 13:01:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 81. [2023-02-15 13:01:20,707 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) [2023-02-15 13:01:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2023-02-15 13:01:20,707 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 14 [2023-02-15 13:01:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:20,707 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2023-02-15 13:01:20,707 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) [2023-02-15 13:01:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2023-02-15 13:01:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:01:20,708 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:20,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:01:20,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 13:01:20,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:20,915 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)] === [2023-02-15 13:01:20,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:20,915 INFO L85 PathProgramCache]: Analyzing trace with hash -177044285, now seen corresponding path program 1 times [2023-02-15 13:01:20,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:01:20,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464041543] [2023-02-15 13:01:20,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:20,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:20,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:01:20,929 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:01:20,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 13:01:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:01:21,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 13:01:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:01:21,079 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 13:01:21,080 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 13:01:21,080 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2023-02-15 13:01:21,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2023-02-15 13:01:21,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2023-02-15 13:01:21,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2023-02-15 13:01:21,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2023-02-15 13:01:21,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2023-02-15 13:01:21,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2023-02-15 13:01:21,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2023-02-15 13:01:21,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2023-02-15 13:01:21,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2023-02-15 13:01:21,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2023-02-15 13:01:21,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2023-02-15 13:01:21,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2023-02-15 13:01:21,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2023-02-15 13:01:21,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2023-02-15 13:01:21,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2023-02-15 13:01:21,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2023-02-15 13:01:21,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2023-02-15 13:01:21,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2023-02-15 13:01:21,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2023-02-15 13:01:21,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2023-02-15 13:01:21,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2023-02-15 13:01:21,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2023-02-15 13:01:21,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2023-02-15 13:01:21,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2023-02-15 13:01:21,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2023-02-15 13:01:21,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2023-02-15 13:01:21,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2023-02-15 13:01:21,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2023-02-15 13:01:21,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2023-02-15 13:01:21,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2023-02-15 13:01:21,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (6 of 38 remaining) [2023-02-15 13:01:21,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (5 of 38 remaining) [2023-02-15 13:01:21,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (4 of 38 remaining) [2023-02-15 13:01:21,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (3 of 38 remaining) [2023-02-15 13:01:21,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (2 of 38 remaining) [2023-02-15 13:01:21,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (1 of 38 remaining) [2023-02-15 13:01:21,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2023-02-15 13:01:21,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 13:01:21,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:01:21,299 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:01:21,302 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:01:21,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:01:21 BoogieIcfgContainer [2023-02-15 13:01:21,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:01:21,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:01:21,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:01:21,330 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:01:21,330 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:01:15" (3/4) ... [2023-02-15 13:01:21,332 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 13:01:21,332 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:01:21,333 INFO L158 Benchmark]: Toolchain (without parser) took 6686.11ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 50.9MB in the beginning and 47.7MB in the end (delta: 3.1MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2023-02-15 13:01:21,333 INFO L158 Benchmark]: CDTParser took 1.59ms. Allocated memory is still 54.5MB. Free memory was 31.5MB in the beginning and 31.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:01:21,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.25ms. Allocated memory is still 75.5MB. Free memory was 50.7MB in the beginning and 50.6MB in the end (delta: 104.5kB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2023-02-15 13:01:21,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.66ms. Allocated memory is still 75.5MB. Free memory was 50.6MB in the beginning and 48.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:01:21,334 INFO L158 Benchmark]: Boogie Preprocessor took 47.79ms. Allocated memory is still 75.5MB. Free memory was 48.5MB in the beginning and 46.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:01:21,334 INFO L158 Benchmark]: RCFGBuilder took 486.16ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 46.4MB in the beginning and 63.6MB in the end (delta: -17.2MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2023-02-15 13:01:21,334 INFO L158 Benchmark]: TraceAbstraction took 5686.86ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 63.0MB in the beginning and 48.7MB in the end (delta: 14.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2023-02-15 13:01:21,335 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 111.1MB. Free memory was 48.7MB in the beginning and 47.7MB in the end (delta: 937.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:01:21,336 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.59ms. Allocated memory is still 54.5MB. Free memory was 31.5MB in the beginning and 31.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.25ms. Allocated memory is still 75.5MB. Free memory was 50.7MB in the beginning and 50.6MB in the end (delta: 104.5kB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.66ms. Allocated memory is still 75.5MB. Free memory was 50.6MB in the beginning and 48.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.79ms. Allocated memory is still 75.5MB. Free memory was 48.5MB in the beginning and 46.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 486.16ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 46.4MB in the beginning and 63.6MB in the end (delta: -17.2MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5686.86ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 63.0MB in the beginning and 48.7MB in the end (delta: 14.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 111.1MB. Free memory was 48.7MB in the beginning and 47.7MB in the end (delta: 937.7kB). 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.6s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 761 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 761 mSDsluCounter, 1107 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 711 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1450 IncrementalHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 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.0s 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, 378 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 [2023-02-15 13:01:21,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample