./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 26d01a9c 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-?-26d01a9 [2023-02-17 03:33:53,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 03:33:53,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 03:33:53,777 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 03:33:53,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 03:33:53,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 03:33:53,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 03:33:53,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 03:33:53,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 03:33:53,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 03:33:53,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 03:33:53,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 03:33:53,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 03:33:53,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 03:33:53,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 03:33:53,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 03:33:53,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 03:33:53,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 03:33:53,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 03:33:53,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 03:33:53,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 03:33:53,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 03:33:53,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 03:33:53,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 03:33:53,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 03:33:53,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 03:33:53,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 03:33:53,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 03:33:53,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 03:33:53,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 03:33:53,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 03:33:53,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 03:33:53,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 03:33:53,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 03:33:53,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 03:33:53,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 03:33:53,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 03:33:53,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 03:33:53,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 03:33:53,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 03:33:53,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 03:33:53,817 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 03:33:53,839 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 03:33:53,845 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 03:33:53,845 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 03:33:53,846 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 03:33:53,846 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 03:33:53,846 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 03:33:53,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 03:33:53,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 03:33:53,847 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 03:33:53,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 03:33:53,847 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 03:33:53,848 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 03:33:53,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 03:33:53,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 03:33:53,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 03:33:53,848 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 03:33:53,848 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 03:33:53,848 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 03:33:53,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 03:33:53,849 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 03:33:53,849 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 03:33:53,849 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 03:33:53,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 03:33:53,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 03:33:53,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 03:33:53,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:33:53,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 03:33:53,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 03:33:53,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 03:33:53,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 03:33:53,850 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 03:33:53,850 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 03:33:53,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 03:33:53,851 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 03:33:53,851 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 03:33:54,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 03:33:54,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 03:33:54,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 03:33:54,024 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 03:33:54,024 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 03:33:54,025 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 03:33:55,059 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 03:33:55,279 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 03:33:55,280 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2023-02-17 03:33:55,284 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b1fa9ec/c6f09ceafb914d00b7305128a7a5b95d/FLAGd1f710ff7 [2023-02-17 03:33:55,296 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b1fa9ec/c6f09ceafb914d00b7305128a7a5b95d [2023-02-17 03:33:55,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 03:33:55,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 03:33:55,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 03:33:55,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 03:33:55,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 03:33:55,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:33:55" (1/1) ... [2023-02-17 03:33:55,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540e8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:55, skipping insertion in model container [2023-02-17 03:33:55,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:33:55" (1/1) ... [2023-02-17 03:33:55,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 03:33:55,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:33:55,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:33:55,442 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 03:33:55,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:33:55,466 INFO L208 MainTranslator]: Completed translation [2023-02-17 03:33:55,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:55 WrapperNode [2023-02-17 03:33:55,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 03:33:55,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 03:33:55,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 03:33:55,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 03:33:55,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:55" (1/1) ... [2023-02-17 03:33:55,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:55" (1/1) ... [2023-02-17 03:33:55,491 INFO L138 Inliner]: procedures = 13, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94 [2023-02-17 03:33:55,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 03:33:55,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 03:33:55,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 03:33:55,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 03:33:55,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:55" (1/1) ... [2023-02-17 03:33:55,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:55" (1/1) ... [2023-02-17 03:33:55,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:55" (1/1) ... [2023-02-17 03:33:55,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:55" (1/1) ... [2023-02-17 03:33:55,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:55" (1/1) ... [2023-02-17 03:33:55,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:55" (1/1) ... [2023-02-17 03:33:55,508 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:55" (1/1) ... [2023-02-17 03:33:55,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:55" (1/1) ... [2023-02-17 03:33:55,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 03:33:55,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 03:33:55,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 03:33:55,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 03:33:55,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:55" (1/1) ... [2023-02-17 03:33:55,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:33:55,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:33:55,558 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 03:33:55,590 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 03:33:55,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 03:33:55,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 03:33:55,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 03:33:55,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 03:33:55,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 03:33:55,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 03:33:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 03:33:55,698 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 03:33:55,700 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 03:33:55,911 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 03:33:55,916 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 03:33:55,917 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-17 03:33:55,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:33:55 BoogieIcfgContainer [2023-02-17 03:33:55,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 03:33:55,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 03:33:55,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 03:33:55,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 03:33:55,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 03:33:55" (1/3) ... [2023-02-17 03:33:55,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ad0ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:33:55, skipping insertion in model container [2023-02-17 03:33:55,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:55" (2/3) ... [2023-02-17 03:33:55,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ad0ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:33:55, skipping insertion in model container [2023-02-17 03:33:55,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:33:55" (3/3) ... [2023-02-17 03:33:55,925 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2023-02-17 03:33:55,937 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 03:33:55,938 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-02-17 03:33:55,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 03:33:55,998 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;@7782b473, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 03:33:55,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-02-17 03:33:56,003 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 03:33:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 03:33:56,008 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:56,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 03:33:56,009 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 03:33:56,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:56,015 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-02-17 03:33:56,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:56,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561720801] [2023-02-17 03:33:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:56,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:56,224 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 03:33:56,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:56,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561720801] [2023-02-17 03:33:56,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561720801] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:33:56,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:33:56,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-17 03:33:56,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114369914] [2023-02-17 03:33:56,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:33:56,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:33:56,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:56,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:33:56,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:33:56,254 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 03:33:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:56,323 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2023-02-17 03:33:56,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:33:56,326 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 03:33:56,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:56,332 INFO L225 Difference]: With dead ends: 52 [2023-02-17 03:33:56,333 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 03:33:56,334 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 03:33:56,337 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.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:56,339 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.1s Time] [2023-02-17 03:33:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 03:33:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-02-17 03:33:56,361 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 03:33:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-17 03:33:56,362 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 4 [2023-02-17 03:33:56,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:56,363 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-17 03:33:56,363 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 03:33:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-17 03:33:56,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 03:33:56,364 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:56,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 03:33:56,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 03:33:56,364 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 03:33:56,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2023-02-17 03:33:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:56,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979943179] [2023-02-17 03:33:56,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:56,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:56,452 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 03:33:56,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:56,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979943179] [2023-02-17 03:33:56,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979943179] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:33:56,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:33:56,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:33:56,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360866892] [2023-02-17 03:33:56,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:33:56,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:33:56,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:56,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:33:56,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:33:56,456 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 03:33:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:56,547 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2023-02-17 03:33:56,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:33:56,548 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 03:33:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:56,550 INFO L225 Difference]: With dead ends: 53 [2023-02-17 03:33:56,551 INFO L226 Difference]: Without dead ends: 53 [2023-02-17 03:33:56,553 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 03:33:56,555 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 03:33:56,556 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 03:33:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-17 03:33:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-02-17 03:33:56,564 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 03:33:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2023-02-17 03:33:56,565 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 4 [2023-02-17 03:33:56,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:56,566 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2023-02-17 03:33:56,566 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 03:33:56,567 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2023-02-17 03:33:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 03:33:56,568 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:56,568 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-02-17 03:33:56,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 03:33:56,569 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 03:33:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1809646286, now seen corresponding path program 1 times [2023-02-17 03:33:56,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:56,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605307927] [2023-02-17 03:33:56,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:56,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:56,726 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 03:33:56,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:56,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605307927] [2023-02-17 03:33:56,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605307927] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:33:56,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322737106] [2023-02-17 03:33:56,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:56,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:33:56,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:33:56,732 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 03:33:56,734 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 03:33:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:56,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 03:33:56,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:33:56,883 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 03:33:56,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:33:56,940 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 03:33:56,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322737106] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:33:56,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:33:56,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-02-17 03:33:56,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893615054] [2023-02-17 03:33:56,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:33:56,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 03:33:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:56,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 03:33:56,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-02-17 03:33:56,949 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 03:33:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:57,055 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2023-02-17 03:33:57,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:33:57,056 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 03:33:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:57,057 INFO L225 Difference]: With dead ends: 59 [2023-02-17 03:33:57,057 INFO L226 Difference]: Without dead ends: 59 [2023-02-17 03:33:57,057 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 03:33:57,058 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 03:33:57,059 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 03:33:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-17 03:33:57,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-02-17 03:33:57,062 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 03:33:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2023-02-17 03:33:57,063 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 7 [2023-02-17 03:33:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:57,063 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2023-02-17 03:33:57,063 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 03:33:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2023-02-17 03:33:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 03:33:57,064 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:57,064 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:33:57,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 03:33:57,268 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 03:33:57,269 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 03:33:57,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2129139286, now seen corresponding path program 1 times [2023-02-17 03:33:57,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:57,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034256035] [2023-02-17 03:33:57,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:57,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:57,383 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 03:33:57,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:57,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034256035] [2023-02-17 03:33:57,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034256035] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:33:57,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786866119] [2023-02-17 03:33:57,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:57,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:33:57,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:33:57,389 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 03:33:57,392 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 03:33:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:57,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 03:33:57,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:33:57,489 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 03:33:57,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:33:57,541 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 03:33:57,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786866119] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:33:57,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:33:57,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-17 03:33:57,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440321551] [2023-02-17 03:33:57,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:33:57,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 03:33:57,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:57,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 03:33:57,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 03:33:57,550 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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 03:33:57,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:57,600 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2023-02-17 03:33:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 03:33:57,600 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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 03:33:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:57,601 INFO L225 Difference]: With dead ends: 77 [2023-02-17 03:33:57,601 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 03:33:57,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 03:33:57,602 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:57,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 290 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:33:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 03:33:57,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-17 03:33:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.3064516129032258) 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 03:33:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-02-17 03:33:57,612 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 19 [2023-02-17 03:33:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:57,612 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-02-17 03:33:57,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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 03:33:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-02-17 03:33:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 03:33:57,613 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:57,614 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:33:57,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 03:33:57,814 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,SelfDestructingSolverStorable3 [2023-02-17 03:33:57,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:33:57,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:57,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069290, now seen corresponding path program 2 times [2023-02-17 03:33:57,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:57,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189226562] [2023-02-17 03:33:57,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:57,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:58,061 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 03:33:58,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:58,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189226562] [2023-02-17 03:33:58,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189226562] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:33:58,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:33:58,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:33:58,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134754056] [2023-02-17 03:33:58,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:33:58,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:33:58,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:58,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:33:58,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:33:58,063 INFO L87 Difference]: Start difference. First operand 77 states and 81 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 03:33:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:58,108 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2023-02-17 03:33:58,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:33:58,109 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 37 [2023-02-17 03:33:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:58,110 INFO L225 Difference]: With dead ends: 85 [2023-02-17 03:33:58,110 INFO L226 Difference]: Without dead ends: 85 [2023-02-17 03:33:58,110 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 03:33:58,116 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 03:33:58,117 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 03:33:58,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-17 03:33:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2023-02-17 03:33:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.3125) internal successors, (84), 78 states have internal predecessors, (84), 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 03:33:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-02-17 03:33:58,133 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 37 [2023-02-17 03:33:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:58,133 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-02-17 03:33:58,134 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 03:33:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-02-17 03:33:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 03:33:58,135 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:58,135 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:33:58,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 03:33:58,135 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:33:58,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:58,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069289, now seen corresponding path program 1 times [2023-02-17 03:33:58,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:58,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059959368] [2023-02-17 03:33:58,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:58,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-02-17 03:33:58,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:58,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059959368] [2023-02-17 03:33:58,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059959368] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:33:58,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:33:58,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:33:58,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963271368] [2023-02-17 03:33:58,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:33:58,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:33:58,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:58,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:33:58,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:33:58,213 INFO L87 Difference]: Start difference. First operand 79 states and 84 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 03:33:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:58,246 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2023-02-17 03:33:58,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:33:58,246 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 37 [2023-02-17 03:33:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:58,247 INFO L225 Difference]: With dead ends: 78 [2023-02-17 03:33:58,247 INFO L226 Difference]: Without dead ends: 78 [2023-02-17 03:33:58,247 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 03:33:58,249 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 03:33:58,249 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 03:33:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-17 03:33:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-17 03:33:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.28125) 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 03:33:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2023-02-17 03:33:58,260 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 37 [2023-02-17 03:33:58,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:58,261 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2023-02-17 03:33:58,261 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 03:33:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2023-02-17 03:33:58,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 03:33:58,263 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:58,263 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:33:58,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 03:33:58,263 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:33:58,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:58,264 INFO L85 PathProgramCache]: Analyzing trace with hash -708557702, now seen corresponding path program 1 times [2023-02-17 03:33:58,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:58,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581901070] [2023-02-17 03:33:58,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:58,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:58,347 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 03:33:58,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:58,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581901070] [2023-02-17 03:33:58,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581901070] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:33:58,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:33:58,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-17 03:33:58,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844635006] [2023-02-17 03:33:58,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:33:58,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:33:58,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:58,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:33:58,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:33:58,349 INFO L87 Difference]: Start difference. First operand 78 states and 82 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 03:33:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:58,369 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2023-02-17 03:33:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:33:58,369 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 38 [2023-02-17 03:33:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:58,370 INFO L225 Difference]: With dead ends: 77 [2023-02-17 03:33:58,370 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 03:33:58,371 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 03:33:58,371 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 03:33:58,372 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 03:33:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 03:33:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-17 03:33:58,374 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 03:33:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-02-17 03:33:58,375 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 38 [2023-02-17 03:33:58,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:58,377 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-02-17 03:33:58,377 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 03:33:58,377 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-02-17 03:33:58,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 03:33:58,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:58,378 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:33:58,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 03:33:58,378 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 03:33:58,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:58,378 INFO L85 PathProgramCache]: Analyzing trace with hash -708557701, now seen corresponding path program 1 times [2023-02-17 03:33:58,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:58,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974930635] [2023-02-17 03:33:58,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:58,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:58,545 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 03:33:58,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:58,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974930635] [2023-02-17 03:33:58,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974930635] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:33:58,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:33:58,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:33:58,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49293517] [2023-02-17 03:33:58,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:33:58,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:33:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:58,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:33:58,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:33:58,549 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 03:33:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:58,587 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2023-02-17 03:33:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:33:58,587 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 03:33:58,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:58,588 INFO L225 Difference]: With dead ends: 80 [2023-02-17 03:33:58,588 INFO L226 Difference]: Without dead ends: 80 [2023-02-17 03:33:58,588 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 03:33:58,590 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 03:33:58,590 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 03:33:58,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-17 03:33:58,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2023-02-17 03:33:58,593 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 03:33:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2023-02-17 03:33:58,594 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2023-02-17 03:33:58,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:58,594 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2023-02-17 03:33:58,594 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 03:33:58,594 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2023-02-17 03:33:58,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-17 03:33:58,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:58,596 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:33:58,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 03:33:58,596 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 03:33:58,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:58,596 INFO L85 PathProgramCache]: Analyzing trace with hash 414994334, now seen corresponding path program 1 times [2023-02-17 03:33:58,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:58,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236138441] [2023-02-17 03:33:58,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:58,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:58,725 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 03:33:58,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:58,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236138441] [2023-02-17 03:33:58,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236138441] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:33:58,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290066324] [2023-02-17 03:33:58,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:58,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:33:58,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:33:58,743 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 03:33:58,744 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 03:33:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:58,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 03:33:58,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:33:58,867 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 03:33:58,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:33:58,925 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 03:33:58,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290066324] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:33:58,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:33:58,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-02-17 03:33:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436020696] [2023-02-17 03:33:58,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:33:58,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 03:33:58,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 03:33:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-17 03:33:58,928 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 03:33:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:59,033 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2023-02-17 03:33:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:33:59,034 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 03:33:59,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:59,035 INFO L225 Difference]: With dead ends: 98 [2023-02-17 03:33:59,035 INFO L226 Difference]: Without dead ends: 98 [2023-02-17 03:33:59,036 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 03:33:59,036 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 293 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:59,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 97 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:33:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-17 03:33:59,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2023-02-17 03:33:59,038 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 03:33:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2023-02-17 03:33:59,039 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 42 [2023-02-17 03:33:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:59,039 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2023-02-17 03:33:59,039 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 03:33:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2023-02-17 03:33:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 03:33:59,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:59,040 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:33:59,062 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 03:33:59,246 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 03:33:59,246 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 03:33:59,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:59,246 INFO L85 PathProgramCache]: Analyzing trace with hash -20077561, now seen corresponding path program 1 times [2023-02-17 03:33:59,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:59,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899858192] [2023-02-17 03:33:59,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:59,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:59,324 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 03:33:59,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:59,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899858192] [2023-02-17 03:33:59,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899858192] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:33:59,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476766291] [2023-02-17 03:33:59,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:59,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:33:59,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:33:59,329 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 03:33:59,376 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 03:33:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:59,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 03:33:59,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:33:59,465 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 03:33:59,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:33:59,491 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 03:33:59,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476766291] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:33:59,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:33:59,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-02-17 03:33:59,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685237171] [2023-02-17 03:33:59,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:33:59,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 03:33:59,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:59,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 03:33:59,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-02-17 03:33:59,493 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 03:33:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:59,596 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2023-02-17 03:33:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:33:59,596 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 03:33:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:59,597 INFO L225 Difference]: With dead ends: 93 [2023-02-17 03:33:59,597 INFO L226 Difference]: Without dead ends: 93 [2023-02-17 03:33:59,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2023-02-17 03:33:59,598 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 114 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:59,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 173 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:33:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-17 03:33:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-17 03:33:59,599 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 03:33:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2023-02-17 03:33:59,600 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 43 [2023-02-17 03:33:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:59,600 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2023-02-17 03:33:59,600 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 03:33:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2023-02-17 03:33:59,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 03:33:59,601 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:59,601 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-02-17 03:33:59,613 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 03:33:59,806 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 03:33:59,806 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 03:33:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:59,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1470341546, now seen corresponding path program 2 times [2023-02-17 03:33:59,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:59,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92065366] [2023-02-17 03:33:59,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:59,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:59,973 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 03:33:59,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:59,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92065366] [2023-02-17 03:33:59,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92065366] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:33:59,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710831226] [2023-02-17 03:33:59,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:33:59,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:33:59,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:33:59,975 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 03:33:59,978 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 03:34:00,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 03:34:00,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:34:00,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-17 03:34:00,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:34:00,138 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 03:34:00,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:34:00,260 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 03:34:00,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710831226] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:34:00,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:34:00,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-02-17 03:34:00,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596966619] [2023-02-17 03:34:00,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:34:00,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-17 03:34:00,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:00,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-17 03:34:00,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2023-02-17 03:34:00,263 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 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 03:34:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:00,598 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2023-02-17 03:34:00,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 03:34:00,598 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 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 03:34:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:00,599 INFO L225 Difference]: With dead ends: 137 [2023-02-17 03:34:00,599 INFO L226 Difference]: Without dead ends: 137 [2023-02-17 03:34:00,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2023-02-17 03:34:00,600 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 596 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:34:00,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 304 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:34:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-17 03:34:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2023-02-17 03:34:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 121 states have internal predecessors, (136), 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 03:34:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2023-02-17 03:34:00,602 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 57 [2023-02-17 03:34:00,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:00,603 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2023-02-17 03:34:00,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 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 03:34:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2023-02-17 03:34:00,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-17 03:34:00,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:00,603 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-02-17 03:34:00,611 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 03:34:00,809 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 03:34:00,809 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 03:34:00,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1664052357, now seen corresponding path program 2 times [2023-02-17 03:34:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:00,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718732855] [2023-02-17 03:34:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:00,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:00,937 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 03:34:00,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:34:00,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718732855] [2023-02-17 03:34:00,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718732855] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:34:00,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325390311] [2023-02-17 03:34:00,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:34:00,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:34:00,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:34:00,965 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 03:34:00,966 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 03:34:01,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 03:34:01,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:34:01,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 03:34:01,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:34:01,076 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 03:34:01,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:34:01,178 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 03:34:01,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325390311] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:34:01,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:34:01,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2023-02-17 03:34:01,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190590761] [2023-02-17 03:34:01,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:34:01,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 03:34:01,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:01,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 03:34:01,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-02-17 03:34:01,180 INFO L87 Difference]: Start difference. First operand 122 states and 136 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 03:34:01,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:01,347 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2023-02-17 03:34:01,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 03:34:01,347 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 03:34:01,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:01,348 INFO L225 Difference]: With dead ends: 121 [2023-02-17 03:34:01,348 INFO L226 Difference]: Without dead ends: 121 [2023-02-17 03:34:01,348 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 03:34:01,349 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 334 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:34:01,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 141 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:34:01,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-17 03:34:01,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-02-17 03:34:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.18348623853211) internal successors, (129), 120 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:34:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2023-02-17 03:34:01,351 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 58 [2023-02-17 03:34:01,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:01,351 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2023-02-17 03:34:01,352 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 03:34:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2023-02-17 03:34:01,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-17 03:34:01,352 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:01,352 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 03:34:01,359 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 03:34:01,557 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 03:34:01,558 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 03:34:01,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:01,558 INFO L85 PathProgramCache]: Analyzing trace with hash 797853176, now seen corresponding path program 1 times [2023-02-17 03:34:01,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:01,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283771341] [2023-02-17 03:34:01,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:01,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:01,642 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 03:34:01,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:34:01,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283771341] [2023-02-17 03:34:01,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283771341] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:34:01,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3252443] [2023-02-17 03:34:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:01,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:34:01,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:34:01,659 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 03:34:01,660 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 03:34:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:01,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 03:34:01,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:34:01,774 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 03:34:01,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:34:01,823 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 03:34:01,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3252443] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:34:01,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:34:01,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2023-02-17 03:34:01,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893288035] [2023-02-17 03:34:01,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:34:01,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 03:34:01,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:01,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 03:34:01,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 03:34:01,825 INFO L87 Difference]: Start difference. First operand 121 states and 129 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 03:34:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:01,861 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2023-02-17 03:34:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 03:34:01,862 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 03:34:01,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:01,862 INFO L225 Difference]: With dead ends: 121 [2023-02-17 03:34:01,862 INFO L226 Difference]: Without dead ends: 121 [2023-02-17 03:34:01,863 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 03:34:01,863 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:34:01,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 137 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:34:01,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-17 03:34:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-02-17 03:34:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.146788990825688) internal successors, (125), 120 states have internal predecessors, (125), 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 03:34:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2023-02-17 03:34:01,865 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 70 [2023-02-17 03:34:01,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:01,865 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2023-02-17 03:34:01,866 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 03:34:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2023-02-17 03:34:01,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-17 03:34:01,866 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:01,866 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2023-02-17 03:34:01,881 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 03:34:02,072 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 03:34:02,072 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:34:02,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:02,073 INFO L85 PathProgramCache]: Analyzing trace with hash -713446614, now seen corresponding path program 3 times [2023-02-17 03:34:02,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:02,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367634660] [2023-02-17 03:34:02,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:02,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 199 proven. 46 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-17 03:34:02,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:34:02,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367634660] [2023-02-17 03:34:02,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367634660] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:34:02,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454042695] [2023-02-17 03:34:02,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 03:34:02,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:34:02,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:34:02,399 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 03:34:02,400 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 03:34:02,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-17 03:34:02,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:34:02,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 03:34:02,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:34:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2023-02-17 03:34:02,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:34:02,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454042695] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:34:02,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 03:34:02,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 20 [2023-02-17 03:34:02,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672466813] [2023-02-17 03:34:02,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:34:02,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:34:02,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:02,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:34:02,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-02-17 03:34:02,558 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 03:34:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:02,616 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2023-02-17 03:34:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:34:02,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 87 [2023-02-17 03:34:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:02,617 INFO L225 Difference]: With dead ends: 120 [2023-02-17 03:34:02,617 INFO L226 Difference]: Without dead ends: 120 [2023-02-17 03:34:02,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2023-02-17 03:34:02,618 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 156 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:34:02,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 64 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:34:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-17 03:34:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2023-02-17 03:34:02,620 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 03:34:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2023-02-17 03:34:02,620 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 87 [2023-02-17 03:34:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:02,621 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2023-02-17 03:34:02,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 03:34:02,621 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2023-02-17 03:34:02,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-17 03:34:02,621 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:02,621 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 03:34:02,629 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 03:34:02,827 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,SelfDestructingSolverStorable13 [2023-02-17 03:34:02,827 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:34:02,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:02,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565048, now seen corresponding path program 2 times [2023-02-17 03:34:02,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:02,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39679288] [2023-02-17 03:34:02,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:02,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:02,976 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 03:34:02,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:34:02,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39679288] [2023-02-17 03:34:02,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39679288] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:34:02,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:34:02,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:34:02,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013281059] [2023-02-17 03:34:02,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:34:02,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:34:02,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:02,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:34:02,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:34:02,978 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 03:34:03,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:03,002 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2023-02-17 03:34:03,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:34:03,003 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 03:34:03,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:03,003 INFO L225 Difference]: With dead ends: 118 [2023-02-17 03:34:03,003 INFO L226 Difference]: Without dead ends: 118 [2023-02-17 03:34:03,004 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 03:34:03,004 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 03:34:03,004 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 03:34:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-17 03:34:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-02-17 03:34:03,006 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 03:34:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2023-02-17 03:34:03,006 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 90 [2023-02-17 03:34:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:03,006 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2023-02-17 03:34:03,007 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 03:34:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2023-02-17 03:34:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-17 03:34:03,007 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:03,007 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 03:34:03,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-17 03:34:03,007 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:34:03,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565049, now seen corresponding path program 1 times [2023-02-17 03:34:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:03,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724992537] [2023-02-17 03:34:03,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:03,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:03,193 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 03:34:03,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:34:03,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724992537] [2023-02-17 03:34:03,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724992537] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:34:03,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:34:03,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:34:03,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949588672] [2023-02-17 03:34:03,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:34:03,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:34:03,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:03,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:34:03,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:34:03,194 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 03:34:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:03,237 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2023-02-17 03:34:03,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:34:03,237 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 03:34:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:03,238 INFO L225 Difference]: With dead ends: 125 [2023-02-17 03:34:03,238 INFO L226 Difference]: Without dead ends: 125 [2023-02-17 03:34:03,238 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 03:34:03,238 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 85 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:34:03,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 87 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:34:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-17 03:34:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2023-02-17 03:34:03,240 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 03:34:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2023-02-17 03:34:03,240 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 90 [2023-02-17 03:34:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:03,241 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2023-02-17 03:34:03,241 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 03:34:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2023-02-17 03:34:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-02-17 03:34:03,241 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:03,241 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 03:34:03,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-17 03:34:03,242 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:34:03,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:03,242 INFO L85 PathProgramCache]: Analyzing trace with hash -634123742, now seen corresponding path program 1 times [2023-02-17 03:34:03,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:03,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742027414] [2023-02-17 03:34:03,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:03,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:03,297 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 03:34:03,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:34:03,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742027414] [2023-02-17 03:34:03,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742027414] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:34:03,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:34:03,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:34:03,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14534337] [2023-02-17 03:34:03,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:34:03,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:34:03,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:03,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:34:03,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:34:03,299 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 03:34:03,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:03,310 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2023-02-17 03:34:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:34:03,311 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 03:34:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:03,311 INFO L225 Difference]: With dead ends: 119 [2023-02-17 03:34:03,311 INFO L226 Difference]: Without dead ends: 119 [2023-02-17 03:34:03,312 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 03:34:03,312 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 03:34:03,312 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 03:34:03,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-17 03:34:03,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-02-17 03:34:03,314 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 03:34:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2023-02-17 03:34:03,314 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 91 [2023-02-17 03:34:03,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:03,314 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2023-02-17 03:34:03,314 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 03:34:03,315 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2023-02-17 03:34:03,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-02-17 03:34:03,315 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:03,315 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 03:34:03,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-17 03:34:03,315 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:34:03,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:03,316 INFO L85 PathProgramCache]: Analyzing trace with hash -634123741, now seen corresponding path program 1 times [2023-02-17 03:34:03,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:03,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887559894] [2023-02-17 03:34:03,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:03,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:03,411 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 03:34:03,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:34:03,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887559894] [2023-02-17 03:34:03,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887559894] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:34:03,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:34:03,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:34:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883400732] [2023-02-17 03:34:03,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:34:03,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:34:03,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:34:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:34:03,413 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 03:34:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:03,429 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2023-02-17 03:34:03,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:34:03,430 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 03:34:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:03,430 INFO L225 Difference]: With dead ends: 122 [2023-02-17 03:34:03,430 INFO L226 Difference]: Without dead ends: 122 [2023-02-17 03:34:03,431 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 03:34:03,431 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 03:34:03,431 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 03:34:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-17 03:34:03,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2023-02-17 03:34:03,433 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 03:34:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2023-02-17 03:34:03,433 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 91 [2023-02-17 03:34:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:03,434 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2023-02-17 03:34:03,434 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 03:34:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2023-02-17 03:34:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-02-17 03:34:03,434 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:03,434 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 03:34:03,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-17 03:34:03,435 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:34:03,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:03,435 INFO L85 PathProgramCache]: Analyzing trace with hash 789303046, now seen corresponding path program 1 times [2023-02-17 03:34:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:03,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287805283] [2023-02-17 03:34:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:03,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:03,636 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 03:34:03,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:34:03,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287805283] [2023-02-17 03:34:03,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287805283] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:34:03,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248349971] [2023-02-17 03:34:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:03,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:34:03,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:34:03,638 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 03:34:03,640 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 03:34:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:03,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 03:34:03,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:34:03,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:34:03,822 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 03:34:03,840 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 03:34:03,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:34:04,199 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 03:34:04,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248349971] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:34:04,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:34:04,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2023-02-17 03:34:04,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104514701] [2023-02-17 03:34:04,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:34:04,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 03:34:04,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:04,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 03:34:04,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-02-17 03:34:04,202 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 03:34:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:04,395 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2023-02-17 03:34:04,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 03:34:04,396 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 03:34:04,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:04,397 INFO L225 Difference]: With dead ends: 180 [2023-02-17 03:34:04,397 INFO L226 Difference]: Without dead ends: 180 [2023-02-17 03:34:04,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2023-02-17 03:34:04,398 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 256 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:34:04,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 239 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:34:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-02-17 03:34:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2023-02-17 03:34:04,401 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 03:34:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2023-02-17 03:34:04,402 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 95 [2023-02-17 03:34:04,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:04,402 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2023-02-17 03:34:04,402 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 03:34:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2023-02-17 03:34:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-02-17 03:34:04,403 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:04,403 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 03:34:04,428 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 03:34:04,610 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 03:34:04,611 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:34:04,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:04,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1301409354, now seen corresponding path program 1 times [2023-02-17 03:34:04,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:04,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662142167] [2023-02-17 03:34:04,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:04,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:04,773 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 03:34:04,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:34:04,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662142167] [2023-02-17 03:34:04,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662142167] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:34:04,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163129750] [2023-02-17 03:34:04,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:04,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:34:04,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:34:04,776 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 03:34:04,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 03:34:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:04,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 03:34:04,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:34:04,964 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 03:34:04,974 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 03:34:04,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:34:04,992 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 03:34:04,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163129750] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:34:04,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:34:04,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-02-17 03:34:04,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727878479] [2023-02-17 03:34:04,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:34:04,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:34:04,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:04,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:34:04,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:34:04,994 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 03:34:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:05,045 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2023-02-17 03:34:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:34:05,046 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 03:34:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:05,047 INFO L225 Difference]: With dead ends: 137 [2023-02-17 03:34:05,047 INFO L226 Difference]: Without dead ends: 137 [2023-02-17 03:34:05,047 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 03:34:05,048 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:34:05,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 99 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:34:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-17 03:34:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-02-17 03:34:05,054 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 03:34:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2023-02-17 03:34:05,055 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 96 [2023-02-17 03:34:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:05,055 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2023-02-17 03:34:05,055 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 03:34:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2023-02-17 03:34:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-02-17 03:34:05,056 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:05,056 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 03:34:05,079 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 03:34:05,263 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 03:34:05,264 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:34:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash -265893408, now seen corresponding path program 1 times [2023-02-17 03:34:05,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:05,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654736573] [2023-02-17 03:34:05,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:05,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:05,383 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 03:34:05,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:34:05,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654736573] [2023-02-17 03:34:05,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654736573] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:34:05,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117026330] [2023-02-17 03:34:05,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:05,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:34:05,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:34:05,415 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 03:34:05,416 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 03:34:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:05,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:34:05,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:34:05,548 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 03:34:05,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:34:05,561 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 03:34:05,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117026330] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:34:05,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:34:05,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-02-17 03:34:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139121717] [2023-02-17 03:34:05,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:34:05,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 03:34:05,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:05,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 03:34:05,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:34:05,563 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 03:34:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:05,590 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2023-02-17 03:34:05,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:34:05,590 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 03:34:05,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:05,591 INFO L225 Difference]: With dead ends: 145 [2023-02-17 03:34:05,591 INFO L226 Difference]: Without dead ends: 145 [2023-02-17 03:34:05,591 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 03:34:05,591 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:34:05,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 157 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:34:05,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-17 03:34:05,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2023-02-17 03:34:05,593 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 03:34:05,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2023-02-17 03:34:05,594 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 103 [2023-02-17 03:34:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:05,594 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2023-02-17 03:34:05,594 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 03:34:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2023-02-17 03:34:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-02-17 03:34:05,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:05,595 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 03:34:05,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-17 03:34:05,803 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 03:34:05,803 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:34:05,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:05,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1508601145, now seen corresponding path program 2 times [2023-02-17 03:34:05,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:05,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880943308] [2023-02-17 03:34:05,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:05,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:06,044 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 03:34:06,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:34:06,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880943308] [2023-02-17 03:34:06,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880943308] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:34:06,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274624261] [2023-02-17 03:34:06,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:34:06,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:34:06,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:34:06,063 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 03:34:06,064 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 03:34:06,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 03:34:06,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:34:06,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 03:34:06,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:34:06,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:34:06,245 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 03:34:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 03:34:06,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:34:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 03:34:06,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274624261] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:34:06,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:34:06,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2023-02-17 03:34:06,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507975698] [2023-02-17 03:34:06,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:34:06,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-17 03:34:06,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:06,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-17 03:34:06,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2023-02-17 03:34:06,631 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand has 24 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 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 03:34:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:07,075 INFO L93 Difference]: Finished difference Result 257 states and 269 transitions. [2023-02-17 03:34:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 03:34:07,076 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 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 03:34:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:07,077 INFO L225 Difference]: With dead ends: 257 [2023-02-17 03:34:07,077 INFO L226 Difference]: Without dead ends: 257 [2023-02-17 03:34:07,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=358, Invalid=1124, Unknown=0, NotChecked=0, Total=1482 [2023-02-17 03:34:07,078 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 723 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:34:07,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 366 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:34:07,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-02-17 03:34:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 164. [2023-02-17 03:34:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 155 states have (on average 1.1419354838709677) internal successors, (177), 163 states have internal predecessors, (177), 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 03:34:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2023-02-17 03:34:07,082 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 110 [2023-02-17 03:34:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:07,082 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2023-02-17 03:34:07,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 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 03:34:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2023-02-17 03:34:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-02-17 03:34:07,083 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:07,083 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 03:34:07,099 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 03:34:07,292 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 03:34:07,293 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:34:07,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:07,293 INFO L85 PathProgramCache]: Analyzing trace with hash -478004765, now seen corresponding path program 2 times [2023-02-17 03:34:07,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:07,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698832582] [2023-02-17 03:34:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:07,445 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 03:34:07,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:34:07,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698832582] [2023-02-17 03:34:07,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698832582] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:34:07,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987791709] [2023-02-17 03:34:07,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:34:07,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:34:07,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:34:07,461 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 03:34:07,495 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 03:34:07,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 03:34:07,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:34:07,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 03:34:07,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:34:07,600 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 03:34:07,629 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 03:34:07,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:34:07,710 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 03:34:07,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987791709] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:34:07,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:34:07,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2023-02-17 03:34:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870823111] [2023-02-17 03:34:07,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:34:07,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 03:34:07,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:07,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 03:34:07,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-02-17 03:34:07,711 INFO L87 Difference]: Start difference. First operand 164 states and 177 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 03:34:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:07,833 INFO L93 Difference]: Finished difference Result 163 states and 171 transitions. [2023-02-17 03:34:07,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 03:34:07,833 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 03:34:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:07,834 INFO L225 Difference]: With dead ends: 163 [2023-02-17 03:34:07,834 INFO L226 Difference]: Without dead ends: 163 [2023-02-17 03:34:07,834 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 03:34:07,835 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 149 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:34:07,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 160 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:34:07,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-02-17 03:34:07,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2023-02-17 03:34:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 155 states have (on average 1.103225806451613) internal successors, (171), 162 states have internal predecessors, (171), 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 03:34:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2023-02-17 03:34:07,837 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 171 transitions. Word has length 111 [2023-02-17 03:34:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:07,837 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 171 transitions. [2023-02-17 03:34:07,837 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 03:34:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2023-02-17 03:34:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-02-17 03:34:07,838 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:07,838 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 03:34:07,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-02-17 03:34:08,044 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 03:34:08,044 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 03:34:08,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:08,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1693145504, now seen corresponding path program 2 times [2023-02-17 03:34:08,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:08,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328646725] [2023-02-17 03:34:08,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:08,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:08,166 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 03:34:08,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:34:08,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328646725] [2023-02-17 03:34:08,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328646725] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:34:08,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148732397] [2023-02-17 03:34:08,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:34:08,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:34:08,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:34:08,182 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:34:08,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-17 03:34:08,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 03:34:08,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:34:08,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 03:34:08,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:34:08,391 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 03:34:08,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:34:08,427 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 03:34:08,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148732397] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:34:08,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:34:08,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2023-02-17 03:34:08,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255625900] [2023-02-17 03:34:08,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:34:08,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 03:34:08,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:08,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 03:34:08,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 03:34:08,428 INFO L87 Difference]: Start difference. First operand 163 states and 171 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 03:34:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:08,468 INFO L93 Difference]: Finished difference Result 163 states and 167 transitions. [2023-02-17 03:34:08,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 03:34:08,468 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 03:34:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:08,469 INFO L225 Difference]: With dead ends: 163 [2023-02-17 03:34:08,469 INFO L226 Difference]: Without dead ends: 163 [2023-02-17 03:34:08,469 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 03:34:08,470 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 5 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:34:08,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 199 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:34:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-02-17 03:34:08,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2023-02-17 03:34:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 155 states have (on average 1.0774193548387097) internal successors, (167), 162 states have internal predecessors, (167), 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 03:34:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2023-02-17 03:34:08,472 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 123 [2023-02-17 03:34:08,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:08,472 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2023-02-17 03:34:08,472 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 03:34:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2023-02-17 03:34:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-02-17 03:34:08,472 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:08,473 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:34:08,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-02-17 03:34:08,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:34:08,679 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:34:08,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:08,679 INFO L85 PathProgramCache]: Analyzing trace with hash 482493849, now seen corresponding path program 3 times [2023-02-17 03:34:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:08,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971317348] [2023-02-17 03:34:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:34:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 199 proven. 46 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-17 03:34:08,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:34:08,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971317348] [2023-02-17 03:34:08,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971317348] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:34:08,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667680391] [2023-02-17 03:34:08,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 03:34:08,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:34:08,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:34:08,842 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:34:08,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-17 03:34:08,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-17 03:34:08,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:34:08,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 03:34:08,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:34:09,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:34:09,003 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 03:34:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2023-02-17 03:34:09,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:34:09,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667680391] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:34:09,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 03:34:09,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 19 [2023-02-17 03:34:09,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267427998] [2023-02-17 03:34:09,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:34:09,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:34:09,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:34:09,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:34:09,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2023-02-17 03:34:09,065 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:34:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:34:09,122 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2023-02-17 03:34:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 03:34:09,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2023-02-17 03:34:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:34:09,123 INFO L225 Difference]: With dead ends: 162 [2023-02-17 03:34:09,123 INFO L226 Difference]: Without dead ends: 162 [2023-02-17 03:34:09,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2023-02-17 03:34:09,123 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 67 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:34:09,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 97 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:34:09,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-17 03:34:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2023-02-17 03:34:09,131 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 03:34:09,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2023-02-17 03:34:09,131 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 140 [2023-02-17 03:34:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:34:09,131 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2023-02-17 03:34:09,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:34:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2023-02-17 03:34:09,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-02-17 03:34:09,132 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:34:09,133 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 03:34:09,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-17 03:34:09,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:34:09,338 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 03:34:09,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:34:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766496, now seen corresponding path program 3 times [2023-02-17 03:34:09,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:34:09,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442145743] [2023-02-17 03:34:09,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:34:09,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:34:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 03:34:09,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 03:34:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 03:34:09,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 03:34:09,516 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 03:34:09,517 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2023-02-17 03:34:09,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2023-02-17 03:34:09,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2023-02-17 03:34:09,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2023-02-17 03:34:09,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2023-02-17 03:34:09,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2023-02-17 03:34:09,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2023-02-17 03:34:09,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2023-02-17 03:34:09,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2023-02-17 03:34:09,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2023-02-17 03:34:09,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2023-02-17 03:34:09,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2023-02-17 03:34:09,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2023-02-17 03:34:09,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2023-02-17 03:34:09,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2023-02-17 03:34:09,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2023-02-17 03:34:09,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2023-02-17 03:34:09,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-17 03:34:09,524 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:34:09,530 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 03:34:09,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 03:34:09 BoogieIcfgContainer [2023-02-17 03:34:09,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 03:34:09,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 03:34:09,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 03:34:09,591 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 03:34:09,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:33:55" (3/4) ... [2023-02-17 03:34:09,593 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 03:34:09,635 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 03:34:09,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 03:34:09,635 INFO L158 Benchmark]: Toolchain (without parser) took 14334.95ms. Allocated memory was 123.7MB in the beginning and 325.1MB in the end (delta: 201.3MB). Free memory was 88.5MB in the beginning and 205.2MB in the end (delta: -116.7MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2023-02-17 03:34:09,635 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory was 91.1MB in the beginning and 91.1MB in the end (delta: 74.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 03:34:09,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.21ms. Allocated memory is still 123.7MB. Free memory was 88.1MB in the beginning and 78.0MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 03:34:09,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.42ms. Allocated memory is still 123.7MB. Free memory was 78.0MB in the beginning and 76.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 03:34:09,636 INFO L158 Benchmark]: Boogie Preprocessor took 18.26ms. Allocated memory is still 123.7MB. Free memory was 76.1MB in the beginning and 74.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 03:34:09,636 INFO L158 Benchmark]: RCFGBuilder took 407.20ms. Allocated memory is still 123.7MB. Free memory was 74.7MB in the beginning and 60.9MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 03:34:09,636 INFO L158 Benchmark]: TraceAbstraction took 13670.81ms. Allocated memory was 123.7MB in the beginning and 325.1MB in the end (delta: 201.3MB). Free memory was 60.3MB in the beginning and 214.6MB in the end (delta: -154.4MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2023-02-17 03:34:09,636 INFO L158 Benchmark]: Witness Printer took 43.93ms. Allocated memory is still 325.1MB. Free memory was 214.6MB in the beginning and 205.2MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 03:34:09,637 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 123.7MB. Free memory was 91.1MB in the beginning and 91.1MB in the end (delta: 74.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.21ms. Allocated memory is still 123.7MB. Free memory was 88.1MB in the beginning and 78.0MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.42ms. Allocated memory is still 123.7MB. Free memory was 78.0MB in the beginning and 76.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.26ms. Allocated memory is still 123.7MB. Free memory was 76.1MB in the beginning and 74.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 407.20ms. Allocated memory is still 123.7MB. Free memory was 74.7MB in the beginning and 60.9MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13670.81ms. Allocated memory was 123.7MB in the beginning and 325.1MB in the end (delta: 201.3MB). Free memory was 60.3MB in the beginning and 214.6MB in the end (delta: -154.4MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * Witness Printer took 43.93ms. Allocated memory is still 325.1MB. Free memory was 214.6MB in the beginning and 205.2MB in the end (delta: 9.4MB). 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: 13.6s, OverallIterations: 26, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3331 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3331 mSDsluCounter, 3364 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2451 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2448 IncrementalHoareTripleChecker+Invalid, 2589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 913 mSDtfsCounter, 2448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2284 GetRequests, 1947 SyntacticMatches, 28 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=22, InterpolantAutomatonStates: 199, 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, 25 MinimizatonAttempts, 182 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2985 NumberOfCodeBlocks, 2646 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 3723 ConstructedInterpolants, 174 QuantifiedInterpolants, 45985 SizeOfPredicates, 39 NumberOfNonLiveVariables, 3509 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 53 InterpolantComputations, 12 PerfectInterpolantSequences, 13197/14234 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 03:34:09,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)