./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 574ddb4e 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/memsafety-ext3/getNumbers4-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 09:00:41,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 09:00:41,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 09:00:41,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 09:00:41,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 09:00:41,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 09:00:41,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 09:00:41,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 09:00:41,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 09:00:41,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 09:00:41,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 09:00:41,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 09:00:41,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 09:00:41,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 09:00:41,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 09:00:41,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 09:00:41,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 09:00:41,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 09:00:41,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 09:00:41,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 09:00:41,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 09:00:41,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 09:00:41,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 09:00:41,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 09:00:41,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 09:00:41,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 09:00:41,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 09:00:41,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 09:00:41,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 09:00:41,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 09:00:41,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 09:00:41,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 09:00:41,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 09:00:41,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 09:00:41,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 09:00:41,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 09:00:41,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 09:00:41,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 09:00:41,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 09:00:41,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 09:00:41,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 09:00:41,267 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 09:00:41,295 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 09:00:41,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 09:00:41,296 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 09:00:41,296 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 09:00:41,297 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 09:00:41,297 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 09:00:41,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 09:00:41,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 09:00:41,298 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 09:00:41,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 09:00:41,298 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 09:00:41,298 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 09:00:41,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 09:00:41,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 09:00:41,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 09:00:41,299 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 09:00:41,299 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 09:00:41,299 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 09:00:41,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 09:00:41,299 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 09:00:41,299 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 09:00:41,299 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 09:00:41,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 09:00:41,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 09:00:41,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 09:00:41,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 09:00:41,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 09:00:41,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 09:00:41,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 09:00:41,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 09:00:41,300 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 09:00:41,300 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 09:00:41,301 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 09:00:41,301 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 09:00:41,301 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 -> 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac [2023-02-17 09:00:41,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 09:00:41,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 09:00:41,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 09:00:41,524 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 09:00:41,525 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 09:00:41,525 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2023-02-17 09:00:42,511 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 09:00:42,717 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 09:00:42,717 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2023-02-17 09:00:42,721 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ae7ec95/d8d002ffe69c470585dcd91faccb8ae6/FLAG21e372a5d [2023-02-17 09:00:42,736 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ae7ec95/d8d002ffe69c470585dcd91faccb8ae6 [2023-02-17 09:00:42,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 09:00:42,738 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 09:00:42,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 09:00:42,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 09:00:42,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 09:00:42,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:00:42" (1/1) ... [2023-02-17 09:00:42,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60da2380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:00:42, skipping insertion in model container [2023-02-17 09:00:42,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:00:42" (1/1) ... [2023-02-17 09:00:42,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 09:00:42,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 09:00:42,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:00:42,897 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 09:00:42,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:00:42,935 INFO L208 MainTranslator]: Completed translation [2023-02-17 09:00:42,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:00:42 WrapperNode [2023-02-17 09:00:42,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 09:00:42,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 09:00:42,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 09:00:42,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 09:00:42,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:00:42" (1/1) ... [2023-02-17 09:00:42,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:00:42" (1/1) ... [2023-02-17 09:00:42,974 INFO L138 Inliner]: procedures = 13, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94 [2023-02-17 09:00:42,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 09:00:42,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 09:00:42,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 09:00:42,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 09:00:42,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:00:42" (1/1) ... [2023-02-17 09:00:42,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:00:42" (1/1) ... [2023-02-17 09:00:42,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:00:42" (1/1) ... [2023-02-17 09:00:42,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:00:42" (1/1) ... [2023-02-17 09:00:43,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:00:42" (1/1) ... [2023-02-17 09:00:43,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:00:42" (1/1) ... [2023-02-17 09:00:43,008 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:00:42" (1/1) ... [2023-02-17 09:00:43,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:00:42" (1/1) ... [2023-02-17 09:00:43,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 09:00:43,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 09:00:43,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 09:00:43,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 09:00:43,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:00:42" (1/1) ... [2023-02-17 09:00:43,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 09:00:43,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:00:43,035 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-17 09:00:43,057 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-17 09:00:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 09:00:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 09:00:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 09:00:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 09:00:43,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 09:00:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 09:00:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 09:00:43,143 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 09:00:43,145 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 09:00:43,344 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 09:00:43,348 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 09:00:43,349 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-17 09:00:43,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:00:43 BoogieIcfgContainer [2023-02-17 09:00:43,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 09:00:43,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 09:00:43,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 09:00:43,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 09:00:43,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 09:00:42" (1/3) ... [2023-02-17 09:00:43,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7245e502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 09:00:43, skipping insertion in model container [2023-02-17 09:00:43,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:00:42" (2/3) ... [2023-02-17 09:00:43,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7245e502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 09:00:43, skipping insertion in model container [2023-02-17 09:00:43,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:00:43" (3/3) ... [2023-02-17 09:00:43,369 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2023-02-17 09:00:43,381 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 09:00:43,381 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-02-17 09:00:43,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 09:00:43,411 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;@588e733a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 09:00:43,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-02-17 09:00:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 52 states have internal predecessors, (62), 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-17 09:00:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 09:00:43,416 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:43,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 09:00:43,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:43,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:43,420 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-02-17 09:00:43,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:43,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233728607] [2023-02-17 09:00:43,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:43,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:43,539 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-17 09:00:43,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:43,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233728607] [2023-02-17 09:00:43,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233728607] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:00:43,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:00:43,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-17 09:00:43,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806445175] [2023-02-17 09:00:43,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:00:43,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:00:43,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:43,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:00:43,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:00:43,568 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:00:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:43,607 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2023-02-17 09:00:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:00:43,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-17 09:00:43,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:43,613 INFO L225 Difference]: With dead ends: 52 [2023-02-17 09:00:43,614 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 09:00:43,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:00:43,617 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:43,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:00:43,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 09:00:43,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-02-17 09:00:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 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-17 09:00:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-17 09:00:43,639 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 4 [2023-02-17 09:00:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:43,640 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-17 09:00:43,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:00:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-17 09:00:43,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 09:00:43,641 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:43,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 09:00:43,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 09:00:43,641 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:43,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:43,642 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2023-02-17 09:00:43,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:43,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941206361] [2023-02-17 09:00:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:43,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:43,710 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-17 09:00:43,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:43,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941206361] [2023-02-17 09:00:43,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941206361] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:00:43,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:00:43,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:00:43,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349972782] [2023-02-17 09:00:43,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:00:43,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:00:43,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:43,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:00:43,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:00:43,713 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:00:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:43,786 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2023-02-17 09:00:43,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:00:43,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-17 09:00:43,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:43,788 INFO L225 Difference]: With dead ends: 53 [2023-02-17 09:00:43,788 INFO L226 Difference]: Without dead ends: 53 [2023-02-17 09:00:43,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:00:43,790 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 53 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:43,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 65 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:00:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-17 09:00:43,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-02-17 09:00:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 51 states have internal predecessors, (56), 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-17 09:00:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2023-02-17 09:00:43,794 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 4 [2023-02-17 09:00:43,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:43,795 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2023-02-17 09:00:43,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:00:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2023-02-17 09:00:43,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 09:00:43,796 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:43,796 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-02-17 09:00:43,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 09:00:43,797 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:43,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1809646286, now seen corresponding path program 1 times [2023-02-17 09:00:43,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:43,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313678871] [2023-02-17 09:00:43,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:43,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:00:43,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:43,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313678871] [2023-02-17 09:00:43,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313678871] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:00:43,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585876090] [2023-02-17 09:00:43,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:43,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:43,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:00:43,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:00:43,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 09:00:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:43,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:00:43,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:00:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:00:44,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:00:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:00:44,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585876090] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:00:44,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:00:44,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-02-17 09:00:44,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025706867] [2023-02-17 09:00:44,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:00:44,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 09:00:44,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:44,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 09:00:44,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-02-17 09:00:44,045 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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-17 09:00:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:44,176 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2023-02-17 09:00:44,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 09:00:44,177 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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-17 09:00:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:44,179 INFO L225 Difference]: With dead ends: 59 [2023-02-17 09:00:44,180 INFO L226 Difference]: Without dead ends: 59 [2023-02-17 09:00:44,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2023-02-17 09:00:44,183 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 166 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:44,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 126 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:00:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-17 09:00:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-02-17 09:00:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 58 states have internal predecessors, (63), 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-17 09:00:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2023-02-17 09:00:44,195 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 7 [2023-02-17 09:00:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:44,195 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2023-02-17 09:00:44,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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-17 09:00:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2023-02-17 09:00:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 09:00:44,196 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:44,196 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:44,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 09:00:44,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:44,401 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:44,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:44,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2129139286, now seen corresponding path program 1 times [2023-02-17 09:00:44,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:44,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61833318] [2023-02-17 09:00:44,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:44,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 09:00:44,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:44,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61833318] [2023-02-17 09:00:44,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61833318] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:00:44,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:00:44,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 09:00:44,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216283750] [2023-02-17 09:00:44,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:00:44,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 09:00:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:44,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 09:00:44,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:00:44,510 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-17 09:00:44,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:44,551 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2023-02-17 09:00:44,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 09:00:44,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 19 [2023-02-17 09:00:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:44,552 INFO L225 Difference]: With dead ends: 67 [2023-02-17 09:00:44,553 INFO L226 Difference]: Without dead ends: 67 [2023-02-17 09:00:44,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:00:44,554 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 113 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:44,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 64 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:00:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-17 09:00:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2023-02-17 09:00:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.434782608695652) internal successors, (66), 60 states have internal predecessors, (66), 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-17 09:00:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2023-02-17 09:00:44,557 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2023-02-17 09:00:44,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:44,557 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2023-02-17 09:00:44,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-17 09:00:44,558 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2023-02-17 09:00:44,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 09:00:44,558 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:44,558 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:44,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 09:00:44,558 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:44,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:44,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2129139287, now seen corresponding path program 1 times [2023-02-17 09:00:44,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:44,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049753242] [2023-02-17 09:00:44,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:44,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 09:00:44,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:44,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049753242] [2023-02-17 09:00:44,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049753242] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:00:44,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:00:44,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 09:00:44,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285177111] [2023-02-17 09:00:44,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:00:44,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 09:00:44,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:44,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 09:00:44,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:00:44,605 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-17 09:00:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:44,642 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2023-02-17 09:00:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 09:00:44,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 19 [2023-02-17 09:00:44,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:44,646 INFO L225 Difference]: With dead ends: 60 [2023-02-17 09:00:44,646 INFO L226 Difference]: Without dead ends: 60 [2023-02-17 09:00:44,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:00:44,647 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 63 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:44,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 89 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:00:44,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-17 09:00:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-02-17 09:00:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.391304347826087) internal successors, (64), 59 states have internal predecessors, (64), 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-17 09:00:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-02-17 09:00:44,655 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 19 [2023-02-17 09:00:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:44,656 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-02-17 09:00:44,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-17 09:00:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-02-17 09:00:44,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 09:00:44,656 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:44,657 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:44,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 09:00:44,657 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:44,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:44,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1578808454, now seen corresponding path program 1 times [2023-02-17 09:00:44,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:44,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616466429] [2023-02-17 09:00:44,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:44,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 09:00:44,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:44,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616466429] [2023-02-17 09:00:44,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616466429] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:00:44,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:00:44,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-17 09:00:44,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196255863] [2023-02-17 09:00:44,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:00:44,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:00:44,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:44,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:00:44,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:00:44,723 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-17 09:00:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:44,741 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2023-02-17 09:00:44,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:00:44,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 20 [2023-02-17 09:00:44,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:44,742 INFO L225 Difference]: With dead ends: 59 [2023-02-17 09:00:44,742 INFO L226 Difference]: Without dead ends: 59 [2023-02-17 09:00:44,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:00:44,743 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:44,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 54 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:00:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-17 09:00:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-02-17 09:00:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 58 states have internal predecessors, (63), 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-17 09:00:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2023-02-17 09:00:44,746 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 20 [2023-02-17 09:00:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:44,746 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2023-02-17 09:00:44,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-17 09:00:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2023-02-17 09:00:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 09:00:44,747 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:44,747 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:44,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 09:00:44,748 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:44,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:44,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1578808453, now seen corresponding path program 1 times [2023-02-17 09:00:44,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:44,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947497563] [2023-02-17 09:00:44,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:00:44,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:44,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947497563] [2023-02-17 09:00:44,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947497563] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:00:44,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168343143] [2023-02-17 09:00:44,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:44,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:44,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:00:44,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:00:44,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 09:00:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:44,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 09:00:44,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:00:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:00:44,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:00:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:00:44,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168343143] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:00:44,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:00:44,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-17 09:00:44,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676024312] [2023-02-17 09:00:44,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:00:44,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 09:00:44,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:44,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 09:00:44,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 09:00:44,938 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-17 09:00:44,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:44,968 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2023-02-17 09:00:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 09:00:44,969 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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 20 [2023-02-17 09:00:44,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:44,970 INFO L225 Difference]: With dead ends: 77 [2023-02-17 09:00:44,970 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 09:00:44,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 09:00:44,970 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:44,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 140 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:00:44,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 09:00:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-17 09:00:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.265625) internal successors, (81), 76 states have internal predecessors, (81), 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-17 09:00:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-02-17 09:00:44,973 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 20 [2023-02-17 09:00:44,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:44,973 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-02-17 09:00:44,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-17 09:00:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-02-17 09:00:44,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 09:00:44,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:44,974 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:44,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 09:00:45,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-02-17 09:00:45,179 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:45,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash -708557701, now seen corresponding path program 2 times [2023-02-17 09:00:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:45,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546196271] [2023-02-17 09:00:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-17 09:00:45,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:45,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546196271] [2023-02-17 09:00:45,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546196271] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:00:45,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:00:45,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:00:45,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600670683] [2023-02-17 09:00:45,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:00:45,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:00:45,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:45,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:00:45,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:00:45,255 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-17 09:00:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:45,285 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2023-02-17 09:00:45,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:00:45,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 38 [2023-02-17 09:00:45,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:45,286 INFO L225 Difference]: With dead ends: 80 [2023-02-17 09:00:45,286 INFO L226 Difference]: Without dead ends: 80 [2023-02-17 09:00:45,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:00:45,286 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 45 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:45,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 60 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:00:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-17 09:00:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2023-02-17 09:00:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 77 states have internal predecessors, (82), 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-17 09:00:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2023-02-17 09:00:45,289 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2023-02-17 09:00:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:45,289 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2023-02-17 09:00:45,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-17 09:00:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2023-02-17 09:00:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-17 09:00:45,290 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:45,290 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:45,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 09:00:45,290 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:45,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash 414994334, now seen corresponding path program 1 times [2023-02-17 09:00:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:45,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300050276] [2023-02-17 09:00:45,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:45,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-17 09:00:45,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:45,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300050276] [2023-02-17 09:00:45,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300050276] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:00:45,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075541708] [2023-02-17 09:00:45,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:45,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:45,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:00:45,409 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:00:45,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 09:00:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:45,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 09:00:45,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:00:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-17 09:00:45,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:00:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-17 09:00:45,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075541708] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:00:45,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:00:45,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-02-17 09:00:45,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740791395] [2023-02-17 09:00:45,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:00:45,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 09:00:45,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:45,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 09:00:45,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-17 09:00:45,583 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:00:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:45,702 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2023-02-17 09:00:45,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 09:00:45,703 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-17 09:00:45,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:45,704 INFO L225 Difference]: With dead ends: 98 [2023-02-17 09:00:45,704 INFO L226 Difference]: Without dead ends: 98 [2023-02-17 09:00:45,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-02-17 09:00:45,705 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 223 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:45,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 155 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:00:45,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-17 09:00:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2023-02-17 09:00:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 91 states have internal predecessors, (100), 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-17 09:00:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2023-02-17 09:00:45,708 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 42 [2023-02-17 09:00:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:45,708 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2023-02-17 09:00:45,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:00:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2023-02-17 09:00:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 09:00:45,709 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:45,709 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:45,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 09:00:45,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:45,914 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:45,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:45,914 INFO L85 PathProgramCache]: Analyzing trace with hash -20077561, now seen corresponding path program 1 times [2023-02-17 09:00:45,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:45,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038126177] [2023-02-17 09:00:45,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:45,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-17 09:00:46,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:46,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038126177] [2023-02-17 09:00:46,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038126177] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:00:46,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884508927] [2023-02-17 09:00:46,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:46,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:46,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:00:46,032 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:00:46,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 09:00:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:46,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:00:46,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:00:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-17 09:00:46,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:00:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-17 09:00:46,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884508927] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:00:46,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:00:46,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-02-17 09:00:46,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352963572] [2023-02-17 09:00:46,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:00:46,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 09:00:46,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:46,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 09:00:46,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-02-17 09:00:46,139 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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-17 09:00:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:46,224 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2023-02-17 09:00:46,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 09:00:46,225 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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 43 [2023-02-17 09:00:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:46,225 INFO L225 Difference]: With dead ends: 93 [2023-02-17 09:00:46,225 INFO L226 Difference]: Without dead ends: 93 [2023-02-17 09:00:46,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2023-02-17 09:00:46,226 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 112 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:46,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 92 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:00:46,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-17 09:00:46,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-17 09:00:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.2125) internal successors, (97), 92 states have internal predecessors, (97), 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-17 09:00:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2023-02-17 09:00:46,229 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 43 [2023-02-17 09:00:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:46,229 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2023-02-17 09:00:46,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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-17 09:00:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2023-02-17 09:00:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 09:00:46,230 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:46,230 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:46,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-17 09:00:46,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:46,435 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:46,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:46,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1470341546, now seen corresponding path program 2 times [2023-02-17 09:00:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:46,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985410102] [2023-02-17 09:00:46,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:46,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-17 09:00:46,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:46,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985410102] [2023-02-17 09:00:46,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985410102] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:00:46,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040360453] [2023-02-17 09:00:46,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:00:46,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:46,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:00:46,581 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:00:46,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 09:00:46,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 09:00:46,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:00:46,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 09:00:46,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:00:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-17 09:00:46,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 09:00:46,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040360453] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:00:46,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 09:00:46,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 15 [2023-02-17 09:00:46,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339781380] [2023-02-17 09:00:46,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:00:46,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 09:00:46,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:46,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 09:00:46,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-02-17 09:00:46,768 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-17 09:00:46,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:46,886 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2023-02-17 09:00:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 09:00:46,886 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 57 [2023-02-17 09:00:46,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:46,887 INFO L225 Difference]: With dead ends: 94 [2023-02-17 09:00:46,887 INFO L226 Difference]: Without dead ends: 94 [2023-02-17 09:00:46,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-02-17 09:00:46,888 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 194 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:46,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 79 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:00:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-17 09:00:46,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2023-02-17 09:00:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.2) internal successors, (96), 91 states have internal predecessors, (96), 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-17 09:00:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2023-02-17 09:00:46,894 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 57 [2023-02-17 09:00:46,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:46,895 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2023-02-17 09:00:46,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-17 09:00:46,895 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2023-02-17 09:00:46,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-17 09:00:46,896 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:46,896 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:46,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 09:00:47,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-17 09:00:47,102 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:47,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1664052357, now seen corresponding path program 2 times [2023-02-17 09:00:47,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:47,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459552000] [2023-02-17 09:00:47,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:47,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-17 09:00:47,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:47,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459552000] [2023-02-17 09:00:47,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459552000] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:00:47,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413439920] [2023-02-17 09:00:47,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:00:47,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:47,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:00:47,242 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:00:47,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 09:00:47,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 09:00:47,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:00:47,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 09:00:47,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:00:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-02-17 09:00:47,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:00:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-02-17 09:00:47,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413439920] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:00:47,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:00:47,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2023-02-17 09:00:47,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631471315] [2023-02-17 09:00:47,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:00:47,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 09:00:47,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:47,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 09:00:47,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-02-17 09:00:47,462 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 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-17 09:00:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:47,669 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2023-02-17 09:00:47,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 09:00:47,670 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 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 58 [2023-02-17 09:00:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:47,670 INFO L225 Difference]: With dead ends: 100 [2023-02-17 09:00:47,670 INFO L226 Difference]: Without dead ends: 100 [2023-02-17 09:00:47,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2023-02-17 09:00:47,671 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 256 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:47,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 245 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:00:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-17 09:00:47,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2023-02-17 09:00:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 98 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-17 09:00:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2023-02-17 09:00:47,676 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 58 [2023-02-17 09:00:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:47,676 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2023-02-17 09:00:47,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 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-17 09:00:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2023-02-17 09:00:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-17 09:00:47,680 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:47,680 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:47,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 09:00:47,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:47,885 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:47,886 INFO L85 PathProgramCache]: Analyzing trace with hash 797853176, now seen corresponding path program 1 times [2023-02-17 09:00:47,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:47,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484587854] [2023-02-17 09:00:47,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:47,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-17 09:00:47,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:47,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484587854] [2023-02-17 09:00:47,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484587854] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:00:47,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050149632] [2023-02-17 09:00:47,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:47,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:47,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:00:48,014 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:00:48,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 09:00:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:48,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 09:00:48,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:00:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-17 09:00:48,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:00:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-17 09:00:48,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050149632] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:00:48,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:00:48,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2023-02-17 09:00:48,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080540419] [2023-02-17 09:00:48,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:00:48,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 09:00:48,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:48,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 09:00:48,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 09:00:48,184 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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-17 09:00:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:48,243 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2023-02-17 09:00:48,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 09:00:48,243 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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 70 [2023-02-17 09:00:48,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:48,244 INFO L225 Difference]: With dead ends: 119 [2023-02-17 09:00:48,244 INFO L226 Difference]: Without dead ends: 119 [2023-02-17 09:00:48,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 09:00:48,244 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:48,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 178 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:00:48,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-17 09:00:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-02-17 09:00:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 118 states have internal predecessors, (123), 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-17 09:00:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2023-02-17 09:00:48,247 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 70 [2023-02-17 09:00:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:48,247 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2023-02-17 09:00:48,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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-17 09:00:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2023-02-17 09:00:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-17 09:00:48,248 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:48,248 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:48,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 09:00:48,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:48,453 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:48,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:48,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565048, now seen corresponding path program 2 times [2023-02-17 09:00:48,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:48,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754501783] [2023-02-17 09:00:48,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:48,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:48,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754501783] [2023-02-17 09:00:48,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754501783] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:00:48,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:00:48,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 09:00:48,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541868003] [2023-02-17 09:00:48,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:00:48,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 09:00:48,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:48,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 09:00:48,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:00:48,589 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 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-17 09:00:48,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:48,614 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2023-02-17 09:00:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 09:00:48,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 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 90 [2023-02-17 09:00:48,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:48,615 INFO L225 Difference]: With dead ends: 118 [2023-02-17 09:00:48,615 INFO L226 Difference]: Without dead ends: 118 [2023-02-17 09:00:48,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:00:48,616 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:48,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 100 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:00:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-17 09:00:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-02-17 09:00:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 108 states have (on average 1.1296296296296295) internal successors, (122), 117 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-17 09:00:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2023-02-17 09:00:48,618 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 90 [2023-02-17 09:00:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:48,618 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2023-02-17 09:00:48,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 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-17 09:00:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2023-02-17 09:00:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-17 09:00:48,619 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:48,619 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:48,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-17 09:00:48,619 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:48,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:48,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565049, now seen corresponding path program 1 times [2023-02-17 09:00:48,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:48,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603615629] [2023-02-17 09:00:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2023-02-17 09:00:48,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:48,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603615629] [2023-02-17 09:00:48,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603615629] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:00:48,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:00:48,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 09:00:48,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499152699] [2023-02-17 09:00:48,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:00:48,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 09:00:48,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:48,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 09:00:48,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:00:48,808 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-17 09:00:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:48,860 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2023-02-17 09:00:48,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 09:00:48,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 90 [2023-02-17 09:00:48,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:48,861 INFO L225 Difference]: With dead ends: 125 [2023-02-17 09:00:48,861 INFO L226 Difference]: Without dead ends: 125 [2023-02-17 09:00:48,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 09:00:48,862 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 68 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:48,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 87 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:00:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-17 09:00:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2023-02-17 09:00:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 119 states have internal predecessors, (124), 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-17 09:00:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2023-02-17 09:00:48,864 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 90 [2023-02-17 09:00:48,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:48,865 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2023-02-17 09:00:48,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-17 09:00:48,865 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2023-02-17 09:00:48,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-02-17 09:00:48,865 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:48,865 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:48,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-17 09:00:48,866 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:48,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:48,866 INFO L85 PathProgramCache]: Analyzing trace with hash -634123742, now seen corresponding path program 1 times [2023-02-17 09:00:48,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:48,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518281283] [2023-02-17 09:00:48,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:48,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:48,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:48,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518281283] [2023-02-17 09:00:48,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518281283] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:00:48,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:00:48,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:00:48,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521143847] [2023-02-17 09:00:48,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:00:48,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:00:48,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:48,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:00:48,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:00:48,956 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-17 09:00:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:48,968 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2023-02-17 09:00:48,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:00:48,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 91 [2023-02-17 09:00:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:48,969 INFO L225 Difference]: With dead ends: 119 [2023-02-17 09:00:48,969 INFO L226 Difference]: Without dead ends: 119 [2023-02-17 09:00:48,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:00:48,969 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:48,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:00:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-17 09:00:48,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-02-17 09:00:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 118 states have internal predecessors, (123), 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-17 09:00:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2023-02-17 09:00:48,971 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 91 [2023-02-17 09:00:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:48,971 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2023-02-17 09:00:48,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-17 09:00:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2023-02-17 09:00:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-02-17 09:00:48,972 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:48,972 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:48,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-17 09:00:48,973 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:48,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash -634123741, now seen corresponding path program 1 times [2023-02-17 09:00:48,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:48,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108492081] [2023-02-17 09:00:48,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:48,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:49,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:49,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108492081] [2023-02-17 09:00:49,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108492081] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:00:49,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:00:49,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:00:49,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623694314] [2023-02-17 09:00:49,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:00:49,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:00:49,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:49,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:00:49,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:00:49,063 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-17 09:00:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:49,080 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2023-02-17 09:00:49,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:00:49,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 91 [2023-02-17 09:00:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:49,080 INFO L225 Difference]: With dead ends: 122 [2023-02-17 09:00:49,081 INFO L226 Difference]: Without dead ends: 122 [2023-02-17 09:00:49,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:00:49,081 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:49,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:00:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-17 09:00:49,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2023-02-17 09:00:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 111 states have (on average 1.117117117117117) internal successors, (124), 119 states have internal predecessors, (124), 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-17 09:00:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2023-02-17 09:00:49,083 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 91 [2023-02-17 09:00:49,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:49,083 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2023-02-17 09:00:49,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-17 09:00:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2023-02-17 09:00:49,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-02-17 09:00:49,084 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:49,084 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:49,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-17 09:00:49,084 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:49,085 INFO L85 PathProgramCache]: Analyzing trace with hash 789303046, now seen corresponding path program 1 times [2023-02-17 09:00:49,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:49,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722708838] [2023-02-17 09:00:49,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:49,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2023-02-17 09:00:49,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:49,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722708838] [2023-02-17 09:00:49,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722708838] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:00:49,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116510472] [2023-02-17 09:00:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:49,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:49,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:00:49,310 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:00:49,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 09:00:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:49,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 09:00:49,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:00:49,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 09:00:49,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 09:00:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:49,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:00:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:49,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116510472] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:00:49,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:00:49,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2023-02-17 09:00:49,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24013535] [2023-02-17 09:00:49,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:00:49,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 09:00:49,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:49,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 09:00:49,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-02-17 09:00:49,724 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 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-17 09:00:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:49,870 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2023-02-17 09:00:49,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 09:00:49,871 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 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 95 [2023-02-17 09:00:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:49,871 INFO L225 Difference]: With dead ends: 180 [2023-02-17 09:00:49,871 INFO L226 Difference]: Without dead ends: 180 [2023-02-17 09:00:49,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2023-02-17 09:00:49,872 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 290 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:49,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 210 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:00:49,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-02-17 09:00:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2023-02-17 09:00:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.136) internal successors, (142), 133 states have internal predecessors, (142), 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-17 09:00:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2023-02-17 09:00:49,874 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 95 [2023-02-17 09:00:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:49,874 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2023-02-17 09:00:49,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 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-17 09:00:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2023-02-17 09:00:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-02-17 09:00:49,875 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:49,875 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:49,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 09:00:50,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-17 09:00:50,081 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:50,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:50,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1301409354, now seen corresponding path program 1 times [2023-02-17 09:00:50,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:50,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082733948] [2023-02-17 09:00:50,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:50,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:50,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:50,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082733948] [2023-02-17 09:00:50,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082733948] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:00:50,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870250497] [2023-02-17 09:00:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:50,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:50,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:00:50,228 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:00:50,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 09:00:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:50,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 09:00:50,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:00:50,400 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-17 09:00:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:50,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:00:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:50,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870250497] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:00:50,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:00:50,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-02-17 09:00:50,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265027763] [2023-02-17 09:00:50,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:00:50,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 09:00:50,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:50,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 09:00:50,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-17 09:00:50,424 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:00:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:50,491 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2023-02-17 09:00:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 09:00:50,492 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-02-17 09:00:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:50,492 INFO L225 Difference]: With dead ends: 137 [2023-02-17 09:00:50,492 INFO L226 Difference]: Without dead ends: 137 [2023-02-17 09:00:50,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-02-17 09:00:50,493 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:50,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 151 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:00:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-17 09:00:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-02-17 09:00:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 126 states have (on average 1.119047619047619) internal successors, (141), 134 states have internal predecessors, (141), 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-17 09:00:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2023-02-17 09:00:50,497 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 96 [2023-02-17 09:00:50,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:50,497 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2023-02-17 09:00:50,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:00:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2023-02-17 09:00:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-02-17 09:00:50,498 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:50,498 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:50,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 09:00:50,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:50,704 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:50,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:50,705 INFO L85 PathProgramCache]: Analyzing trace with hash -265893408, now seen corresponding path program 1 times [2023-02-17 09:00:50,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:50,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500385792] [2023-02-17 09:00:50,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:50,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:50,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:50,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500385792] [2023-02-17 09:00:50,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500385792] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:00:50,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577538245] [2023-02-17 09:00:50,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:50,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:50,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:00:50,802 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:00:50,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-17 09:00:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:50,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 09:00:50,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:00:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:50,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:00:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:50,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577538245] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:00:50,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:00:50,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-02-17 09:00:50,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764438743] [2023-02-17 09:00:50,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:00:50,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 09:00:50,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:50,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 09:00:50,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-02-17 09:00:50,969 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:00:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:50,994 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2023-02-17 09:00:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 09:00:50,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2023-02-17 09:00:50,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:50,996 INFO L225 Difference]: With dead ends: 145 [2023-02-17 09:00:50,996 INFO L226 Difference]: Without dead ends: 145 [2023-02-17 09:00:50,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-02-17 09:00:50,996 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:50,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 120 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:00:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-17 09:00:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2023-02-17 09:00:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 142 states have internal predecessors, (149), 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-17 09:00:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2023-02-17 09:00:50,999 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 103 [2023-02-17 09:00:50,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:50,999 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2023-02-17 09:00:50,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:00:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2023-02-17 09:00:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-02-17 09:00:51,000 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:51,000 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:51,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-17 09:00:51,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:51,206 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:51,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1508601145, now seen corresponding path program 2 times [2023-02-17 09:00:51,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:51,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394009134] [2023-02-17 09:00:51,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:51,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 28 proven. 38 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2023-02-17 09:00:51,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:51,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394009134] [2023-02-17 09:00:51,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394009134] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:00:51,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061095080] [2023-02-17 09:00:51,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:00:51,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:51,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:00:51,470 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:00:51,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-17 09:00:51,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 09:00:51,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:00:51,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 09:00:51,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:00:51,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 09:00:51,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 09:00:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:51,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 09:00:51,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061095080] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:00:51,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 09:00:51,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 16 [2023-02-17 09:00:51,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652477323] [2023-02-17 09:00:51,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:00:51,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 09:00:51,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:51,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 09:00:51,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-02-17 09:00:51,700 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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-17 09:00:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:51,797 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2023-02-17 09:00:51,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 09:00:51,798 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 110 [2023-02-17 09:00:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:51,798 INFO L225 Difference]: With dead ends: 142 [2023-02-17 09:00:51,798 INFO L226 Difference]: Without dead ends: 142 [2023-02-17 09:00:51,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2023-02-17 09:00:51,799 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 122 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:51,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 94 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:00:51,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-17 09:00:51,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-02-17 09:00:51,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 134 states have (on average 1.0970149253731343) internal successors, (147), 141 states have internal predecessors, (147), 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-17 09:00:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2023-02-17 09:00:51,802 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 110 [2023-02-17 09:00:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:51,802 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2023-02-17 09:00:51,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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-17 09:00:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2023-02-17 09:00:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-02-17 09:00:51,803 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:51,803 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:51,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-17 09:00:52,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-17 09:00:52,009 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:52,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:52,010 INFO L85 PathProgramCache]: Analyzing trace with hash -478004765, now seen corresponding path program 2 times [2023-02-17 09:00:52,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:52,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109662667] [2023-02-17 09:00:52,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:52,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:52,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:52,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109662667] [2023-02-17 09:00:52,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109662667] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:00:52,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510008066] [2023-02-17 09:00:52,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:00:52,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:52,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:00:52,179 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:00:52,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-17 09:00:52,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 09:00:52,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:00:52,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:00:52,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:00:52,325 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-17 09:00:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2023-02-17 09:00:52,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:00:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2023-02-17 09:00:52,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510008066] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:00:52,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:00:52,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2023-02-17 09:00:52,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738841900] [2023-02-17 09:00:52,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:00:52,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 09:00:52,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:52,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 09:00:52,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-02-17 09:00:52,416 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 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-17 09:00:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:52,550 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2023-02-17 09:00:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 09:00:52,551 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 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 111 [2023-02-17 09:00:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:52,552 INFO L225 Difference]: With dead ends: 142 [2023-02-17 09:00:52,552 INFO L226 Difference]: Without dead ends: 142 [2023-02-17 09:00:52,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2023-02-17 09:00:52,552 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 200 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:52,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 223 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:00:52,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-17 09:00:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2023-02-17 09:00:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 140 states have internal predecessors, (145), 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-17 09:00:52,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2023-02-17 09:00:52,555 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 111 [2023-02-17 09:00:52,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:52,555 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2023-02-17 09:00:52,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 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-17 09:00:52,555 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2023-02-17 09:00:52,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-02-17 09:00:52,556 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:52,556 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:52,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-17 09:00:52,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-17 09:00:52,761 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:52,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:52,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1693145504, now seen corresponding path program 2 times [2023-02-17 09:00:52,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:52,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682914084] [2023-02-17 09:00:52,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:52,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:00:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:52,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:00:52,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682914084] [2023-02-17 09:00:52,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682914084] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:00:52,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518112603] [2023-02-17 09:00:52,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:00:52,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:00:52,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:00:52,889 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:00:52,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-17 09:00:53,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 09:00:53,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:00:53,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 09:00:53,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:00:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:53,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:00:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 09:00:53,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518112603] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:00:53,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:00:53,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2023-02-17 09:00:53,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002926460] [2023-02-17 09:00:53,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:00:53,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 09:00:53,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:00:53,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 09:00:53,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 09:00:53,089 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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-17 09:00:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:00:53,124 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2023-02-17 09:00:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 09:00:53,125 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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 123 [2023-02-17 09:00:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:00:53,125 INFO L225 Difference]: With dead ends: 161 [2023-02-17 09:00:53,125 INFO L226 Difference]: Without dead ends: 161 [2023-02-17 09:00:53,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 232 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 09:00:53,126 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:00:53,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 162 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:00:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-17 09:00:53,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-02-17 09:00:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 154 states have (on average 1.0714285714285714) internal successors, (165), 160 states have internal predecessors, (165), 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-17 09:00:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2023-02-17 09:00:53,129 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 123 [2023-02-17 09:00:53,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:00:53,129 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2023-02-17 09:00:53,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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-17 09:00:53,129 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2023-02-17 09:00:53,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-02-17 09:00:53,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:00:53,130 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:53,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-17 09:00:53,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-17 09:00:53,336 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 09:00:53,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:00:53,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766496, now seen corresponding path program 3 times [2023-02-17 09:00:53,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:00:53,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765280236] [2023-02-17 09:00:53,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:00:53,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:00:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:00:53,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:00:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:00:53,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:00:53,466 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 09:00:53,467 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2023-02-17 09:00:53,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2023-02-17 09:00:53,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2023-02-17 09:00:53,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2023-02-17 09:00:53,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2023-02-17 09:00:53,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2023-02-17 09:00:53,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2023-02-17 09:00:53,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2023-02-17 09:00:53,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2023-02-17 09:00:53,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2023-02-17 09:00:53,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2023-02-17 09:00:53,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2023-02-17 09:00:53,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2023-02-17 09:00:53,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2023-02-17 09:00:53,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2023-02-17 09:00:53,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2023-02-17 09:00:53,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2023-02-17 09:00:53,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-17 09:00:53,474 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:00:53,477 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 09:00:53,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 09:00:53 BoogieIcfgContainer [2023-02-17 09:00:53,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 09:00:53,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 09:00:53,556 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 09:00:53,556 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 09:00:53,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:00:43" (3/4) ... [2023-02-17 09:00:53,558 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 09:00:53,622 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 09:00:53,623 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 09:00:53,623 INFO L158 Benchmark]: Toolchain (without parser) took 10884.83ms. Allocated memory was 104.9MB in the beginning and 297.8MB in the end (delta: 192.9MB). Free memory was 72.3MB in the beginning and 154.2MB in the end (delta: -81.9MB). Peak memory consumption was 112.7MB. Max. memory is 16.1GB. [2023-02-17 09:00:53,623 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:00:53,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.77ms. Allocated memory is still 104.9MB. Free memory was 72.3MB in the beginning and 61.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 09:00:53,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.63ms. Allocated memory is still 104.9MB. Free memory was 61.5MB in the beginning and 59.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 09:00:53,624 INFO L158 Benchmark]: Boogie Preprocessor took 36.70ms. Allocated memory is still 104.9MB. Free memory was 59.9MB in the beginning and 58.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 09:00:53,625 INFO L158 Benchmark]: RCFGBuilder took 337.71ms. Allocated memory is still 104.9MB. Free memory was 58.3MB in the beginning and 44.6MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 09:00:53,627 INFO L158 Benchmark]: TraceAbstraction took 10193.33ms. Allocated memory was 104.9MB in the beginning and 297.8MB in the end (delta: 192.9MB). Free memory was 78.2MB in the beginning and 164.6MB in the end (delta: -86.5MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. [2023-02-17 09:00:53,628 INFO L158 Benchmark]: Witness Printer took 67.41ms. Allocated memory is still 297.8MB. Free memory was 164.6MB in the beginning and 154.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 09:00:53,631 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.15ms. Allocated memory is still 104.9MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.77ms. Allocated memory is still 104.9MB. Free memory was 72.3MB in the beginning and 61.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.63ms. Allocated memory is still 104.9MB. Free memory was 61.5MB in the beginning and 59.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.70ms. Allocated memory is still 104.9MB. Free memory was 59.9MB in the beginning and 58.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 337.71ms. Allocated memory is still 104.9MB. Free memory was 58.3MB in the beginning and 44.6MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10193.33ms. Allocated memory was 104.9MB in the beginning and 297.8MB in the end (delta: 192.9MB). Free memory was 78.2MB in the beginning and 164.6MB in the end (delta: -86.5MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. * Witness Printer took 67.41ms. Allocated memory is still 297.8MB. Free memory was 164.6MB in the beginning and 154.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L45] CALL getNumbers4() [L35] CALL, EXPR getNumbers3() [L25] CALL, EXPR getNumbers2() [L16] CALL, EXPR getNumbers() [L8] int i = 0; VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=10, numbers2={2:0}, numbers4={3:0}] [L8] COND FALSE !(i < 10) VAL [array={1:0}, i=10, numbers2={2:0}, numbers4={3:0}] [L12] return array; VAL [\result={1:0}, array={1:0}, i=10, numbers2={2:0}, numbers4={3:0}] [L16] RET, EXPR getNumbers() [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={1:0}, i=0, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=0, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=0] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=0, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=0] [L18] ++i VAL [array={1:0}, i=1, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=1, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=1] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=1, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=1] [L18] ++i VAL [array={1:0}, i=2, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=2, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=2] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=2, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=2] [L18] ++i VAL [array={1:0}, i=3, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=3, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=3] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=3, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=3] [L18] ++i VAL [array={1:0}, i=4, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=4, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=4] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=4, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=4] [L18] ++i VAL [array={1:0}, i=5, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=5, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=5] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=5, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=5] [L18] ++i VAL [array={1:0}, i=6, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=6, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=6] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=6, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=6] [L18] ++i VAL [array={1:0}, i=7, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=7, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=7] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=7, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=7] [L18] ++i VAL [array={1:0}, i=8, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=8, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=8] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=8, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=8] [L18] ++i VAL [array={1:0}, i=9, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=9, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=9] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=9, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=9] [L18] ++i VAL [array={1:0}, i=10, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND FALSE !(i < 10) VAL [array={1:0}, i=10, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L21] return numbers2; VAL [\result={2:0}, array={1:0}, i=10, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L25] RET, EXPR getNumbers2() [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={1:0}, i=0, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=0, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=0] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=0, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=0] [L27] ++i VAL [array={1:0}, i=1, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=1, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=1] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=1, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=1] [L27] ++i VAL [array={1:0}, i=2, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=2, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=2] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=2, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=2] [L27] ++i VAL [array={1:0}, i=3, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=3, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=3] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=3, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=3] [L27] ++i VAL [array={1:0}, i=4, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=4, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=4] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=4, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=4] [L27] ++i VAL [array={1:0}, i=5, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=5, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=5] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=5, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=5] [L27] ++i VAL [array={1:0}, i=6, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=6, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=6] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=6, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=6] [L27] ++i VAL [array={1:0}, i=7, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=7, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=7] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=7, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=7] [L27] ++i VAL [array={1:0}, i=8, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=8, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=8] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=8, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=8] [L27] ++i VAL [array={1:0}, i=9, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=9, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=9] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=9, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=9] [L27] ++i VAL [array={1:0}, i=10, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND FALSE !(i < 10) VAL [array={1:0}, i=10, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L31] return numbers3; [L31] return numbers3; VAL [\result={10:0}, array={1:0}, i=10, numbers={2:0}, numbers2={2:0}, numbers4={3:0}] [L35] RET, EXPR getNumbers3() [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={1:0}, i=0, numbers={10:0}, numbers2={2:0}, numbers4={3:0}] [L37] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers={10:0}, numbers2={2:0}, numbers4={3:0}] [L38] numbers[i] - 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: 43]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 24, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2017 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2017 mSDsluCounter, 2690 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1840 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1788 IncrementalHoareTripleChecker+Invalid, 1885 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 850 mSDtfsCounter, 1788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1847 GetRequests, 1581 SyntacticMatches, 27 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=23, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 76 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2479 NumberOfCodeBlocks, 2329 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3057 ConstructedInterpolants, 87 QuantifiedInterpolants, 32827 SizeOfPredicates, 30 NumberOfNonLiveVariables, 3310 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 47 InterpolantComputations, 12 PerfectInterpolantSequences, 10441/11234 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-17 09:00:53,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)