./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:23:38,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:23:38,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:23:38,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:23:38,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:23:38,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:23:38,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:23:38,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:23:38,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:23:38,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:23:38,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:23:38,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:23:38,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:23:38,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:23:38,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:23:38,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:23:38,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:23:38,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:23:38,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:23:38,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:23:38,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:23:38,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:23:38,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:23:38,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:23:38,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:23:38,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:23:38,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:23:38,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:23:38,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:23:38,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:23:38,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:23:38,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:23:38,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:23:38,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:23:38,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:23:38,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:23:38,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:23:38,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:23:38,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:23:38,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:23:38,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:23:38,706 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 08:23:38,729 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:23:38,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:23:38,730 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:23:38,730 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:23:38,731 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:23:38,731 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:23:38,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:23:38,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:23:38,732 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:23:38,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:23:38,733 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:23:38,733 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:23:38,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:23:38,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:23:38,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:23:38,734 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:23:38,734 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:23:38,734 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:23:38,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:23:38,735 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:23:38,735 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:23:38,735 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:23:38,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:23:38,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:23:38,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:23:38,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:23:38,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:23:38,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:23:38,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 08:23:38,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 08:23:38,737 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:23:38,737 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:23:38,737 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:23:38,738 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:23:38,738 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 -> ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d [2023-02-17 08:23:38,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:23:38,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:23:38,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:23:38,974 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:23:38,975 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:23:38,976 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2023-02-17 08:23:40,197 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:23:40,412 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:23:40,413 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2023-02-17 08:23:40,423 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1162ecf6/0a52f89632c64685a427b1456db0733c/FLAGd4c4a7187 [2023-02-17 08:23:40,434 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1162ecf6/0a52f89632c64685a427b1456db0733c [2023-02-17 08:23:40,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:23:40,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:23:40,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:23:40,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:23:40,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:23:40,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:23:40" (1/1) ... [2023-02-17 08:23:40,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c827ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:23:40, skipping insertion in model container [2023-02-17 08:23:40,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:23:40" (1/1) ... [2023-02-17 08:23:40,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:23:40,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:23:40,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:23:40,787 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 08:23:40,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:23:40,888 INFO L208 MainTranslator]: Completed translation [2023-02-17 08:23:40,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:23:40 WrapperNode [2023-02-17 08:23:40,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:23:40,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 08:23:40,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 08:23:40,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 08:23:40,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:23:40" (1/1) ... [2023-02-17 08:23:40,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:23:40" (1/1) ... [2023-02-17 08:23:40,949 INFO L138 Inliner]: procedures = 123, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2023-02-17 08:23:40,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 08:23:40,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 08:23:40,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 08:23:40,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 08:23:40,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:23:40" (1/1) ... [2023-02-17 08:23:40,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:23:40" (1/1) ... [2023-02-17 08:23:40,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:23:40" (1/1) ... [2023-02-17 08:23:40,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:23:40" (1/1) ... [2023-02-17 08:23:40,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:23:40" (1/1) ... [2023-02-17 08:23:40,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:23:40" (1/1) ... [2023-02-17 08:23:40,991 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:23:40" (1/1) ... [2023-02-17 08:23:40,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:23:40" (1/1) ... [2023-02-17 08:23:41,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 08:23:41,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 08:23:41,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 08:23:41,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 08:23:41,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:23:40" (1/1) ... [2023-02-17 08:23:41,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:23:41,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:23:41,038 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 08:23:41,059 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 08:23:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 08:23:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 08:23:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 08:23:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 08:23:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 08:23:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 08:23:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 08:23:41,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 08:23:41,197 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 08:23:41,202 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 08:23:41,502 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 08:23:41,521 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 08:23:41,521 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-17 08:23:41,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:23:41 BoogieIcfgContainer [2023-02-17 08:23:41,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 08:23:41,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 08:23:41,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 08:23:41,528 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 08:23:41,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 08:23:40" (1/3) ... [2023-02-17 08:23:41,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331f3c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:23:41, skipping insertion in model container [2023-02-17 08:23:41,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:23:40" (2/3) ... [2023-02-17 08:23:41,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331f3c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:23:41, skipping insertion in model container [2023-02-17 08:23:41,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:23:41" (3/3) ... [2023-02-17 08:23:41,530 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_cnstr.i [2023-02-17 08:23:41,541 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 08:23:41,542 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2023-02-17 08:23:41,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 08:23:41,582 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;@73e156f3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 08:23:41,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-02-17 08:23:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 66 states have (on average 2.121212121212121) internal successors, (140), 122 states have internal predecessors, (140), 0 states have call successors, (0), 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 08:23:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-17 08:23:41,592 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:41,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-17 08:23:41,593 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:41,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:41,599 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-17 08:23:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:41,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179908861] [2023-02-17 08:23:41,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:41,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:41,799 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 08:23:41,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:41,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179908861] [2023-02-17 08:23:41,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179908861] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:41,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:41,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:23:41,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8916575] [2023-02-17 08:23:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:41,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:23:41,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:23:41,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:23:41,861 INFO L87 Difference]: Start difference. First operand has 123 states, 66 states have (on average 2.121212121212121) internal successors, (140), 122 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:42,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:42,046 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2023-02-17 08:23:42,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:23:42,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-17 08:23:42,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:42,056 INFO L225 Difference]: With dead ends: 166 [2023-02-17 08:23:42,057 INFO L226 Difference]: Without dead ends: 162 [2023-02-17 08:23:42,059 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 08:23:42,063 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 128 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:42,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 106 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:23:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-17 08:23:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 119. [2023-02-17 08:23:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 2.0307692307692307) internal successors, (132), 118 states have internal predecessors, (132), 0 states have call successors, (0), 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 08:23:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-02-17 08:23:42,112 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 3 [2023-02-17 08:23:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:42,113 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-02-17 08:23:42,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-02-17 08:23:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-17 08:23:42,114 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:42,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-17 08:23:42,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 08:23:42,115 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:42,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:42,116 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-17 08:23:42,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:42,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348732304] [2023-02-17 08:23:42,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:42,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:42,194 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 08:23:42,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:42,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348732304] [2023-02-17 08:23:42,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348732304] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:42,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:42,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:23:42,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932019177] [2023-02-17 08:23:42,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:42,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:23:42,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:42,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:23:42,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:23:42,198 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:42,312 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2023-02-17 08:23:42,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:23:42,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-17 08:23:42,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:42,316 INFO L225 Difference]: With dead ends: 160 [2023-02-17 08:23:42,316 INFO L226 Difference]: Without dead ends: 160 [2023-02-17 08:23:42,319 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 08:23:42,320 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 125 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:42,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 110 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:23:42,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-17 08:23:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2023-02-17 08:23:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 65 states have (on average 2.0) internal successors, (130), 116 states have internal predecessors, (130), 0 states have call successors, (0), 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 08:23:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2023-02-17 08:23:42,335 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 3 [2023-02-17 08:23:42,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:42,335 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2023-02-17 08:23:42,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2023-02-17 08:23:42,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 08:23:42,336 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:42,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:42,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 08:23:42,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:42,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031021, now seen corresponding path program 1 times [2023-02-17 08:23:42,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:42,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223074785] [2023-02-17 08:23:42,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:42,429 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 08:23:42,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:42,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223074785] [2023-02-17 08:23:42,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223074785] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:42,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:42,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:23:42,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101048379] [2023-02-17 08:23:42,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:42,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:23:42,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:42,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:23:42,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:23:42,432 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:42,609 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2023-02-17 08:23:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:23:42,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-17 08:23:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:42,611 INFO L225 Difference]: With dead ends: 146 [2023-02-17 08:23:42,611 INFO L226 Difference]: Without dead ends: 146 [2023-02-17 08:23:42,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:23:42,617 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 233 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:42,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 75 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:23:42,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-17 08:23:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2023-02-17 08:23:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.7647058823529411) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 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 08:23:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2023-02-17 08:23:42,631 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 7 [2023-02-17 08:23:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:42,632 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2023-02-17 08:23:42,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2023-02-17 08:23:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 08:23:42,633 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:42,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:42,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 08:23:42,633 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:42,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:42,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031022, now seen corresponding path program 1 times [2023-02-17 08:23:42,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:42,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079166239] [2023-02-17 08:23:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:42,743 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 08:23:42,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:42,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079166239] [2023-02-17 08:23:42,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079166239] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:42,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:42,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:23:42,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350131641] [2023-02-17 08:23:42,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:42,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:23:42,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:42,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:23:42,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:23:42,747 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:42,986 INFO L93 Difference]: Finished difference Result 227 states and 259 transitions. [2023-02-17 08:23:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:23:42,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-17 08:23:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:42,989 INFO L225 Difference]: With dead ends: 227 [2023-02-17 08:23:42,990 INFO L226 Difference]: Without dead ends: 227 [2023-02-17 08:23:42,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:23:42,996 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 267 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:42,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 124 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:23:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-17 08:23:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 172. [2023-02-17 08:23:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6985294117647058) internal successors, (231), 171 states have internal predecessors, (231), 0 states have call successors, (0), 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 08:23:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 231 transitions. [2023-02-17 08:23:43,010 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 231 transitions. Word has length 7 [2023-02-17 08:23:43,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:43,011 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 231 transitions. [2023-02-17 08:23:43,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:43,011 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 231 transitions. [2023-02-17 08:23:43,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 08:23:43,012 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:43,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:43,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 08:23:43,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:43,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:43,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1237592114, now seen corresponding path program 1 times [2023-02-17 08:23:43,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:43,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279450109] [2023-02-17 08:23:43,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:43,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:43,067 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 08:23:43,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:43,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279450109] [2023-02-17 08:23:43,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279450109] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:43,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:43,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:23:43,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765011510] [2023-02-17 08:23:43,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:43,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:23:43,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:43,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:23:43,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:23:43,071 INFO L87 Difference]: Start difference. First operand 172 states and 231 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 08:23:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:43,080 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2023-02-17 08:23:43,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:23:43,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 10 [2023-02-17 08:23:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:43,081 INFO L225 Difference]: With dead ends: 186 [2023-02-17 08:23:43,082 INFO L226 Difference]: Without dead ends: 186 [2023-02-17 08:23:43,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 08:23:43,083 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 103 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:43,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 156 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:23:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-17 08:23:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2023-02-17 08:23:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6838235294117647) internal successors, (229), 171 states have internal predecessors, (229), 0 states have call successors, (0), 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 08:23:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 229 transitions. [2023-02-17 08:23:43,087 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 229 transitions. Word has length 10 [2023-02-17 08:23:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:43,087 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 229 transitions. [2023-02-17 08:23:43,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 08:23:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2023-02-17 08:23:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 08:23:43,090 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:43,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:43,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 08:23:43,090 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:43,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:43,095 INFO L85 PathProgramCache]: Analyzing trace with hash -288934911, now seen corresponding path program 1 times [2023-02-17 08:23:43,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:43,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273669414] [2023-02-17 08:23:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:43,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:43,121 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 08:23:43,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:43,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273669414] [2023-02-17 08:23:43,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273669414] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:43,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:43,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:23:43,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027132205] [2023-02-17 08:23:43,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:43,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:23:43,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:43,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:23:43,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:23:43,124 INFO L87 Difference]: Start difference. First operand 172 states and 229 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:43,131 INFO L93 Difference]: Finished difference Result 175 states and 232 transitions. [2023-02-17 08:23:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:23:43,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-17 08:23:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:43,132 INFO L225 Difference]: With dead ends: 175 [2023-02-17 08:23:43,133 INFO L226 Difference]: Without dead ends: 175 [2023-02-17 08:23:43,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 08:23:43,133 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:43,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:23:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-17 08:23:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-02-17 08:23:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 139 states have (on average 1.669064748201439) internal successors, (232), 174 states have internal predecessors, (232), 0 states have call successors, (0), 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 08:23:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 232 transitions. [2023-02-17 08:23:43,137 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 232 transitions. Word has length 14 [2023-02-17 08:23:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:43,138 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 232 transitions. [2023-02-17 08:23:43,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 232 transitions. [2023-02-17 08:23:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 08:23:43,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:43,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:43,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 08:23:43,139 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:43,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1836248265, now seen corresponding path program 1 times [2023-02-17 08:23:43,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:43,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681626146] [2023-02-17 08:23:43,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:43,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:43,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:43,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681626146] [2023-02-17 08:23:43,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681626146] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:43,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:43,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:23:43,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331952042] [2023-02-17 08:23:43,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:43,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:23:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:43,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:23:43,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:23:43,164 INFO L87 Difference]: Start difference. First operand 175 states and 232 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:43,171 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2023-02-17 08:23:43,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:23:43,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-17 08:23:43,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:43,172 INFO L225 Difference]: With dead ends: 177 [2023-02-17 08:23:43,172 INFO L226 Difference]: Without dead ends: 177 [2023-02-17 08:23:43,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 08:23:43,173 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:43,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:23:43,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-17 08:23:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2023-02-17 08:23:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 141 states have (on average 1.6595744680851063) internal successors, (234), 176 states have internal predecessors, (234), 0 states have call successors, (0), 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 08:23:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2023-02-17 08:23:43,177 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 14 [2023-02-17 08:23:43,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:43,177 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2023-02-17 08:23:43,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:43,177 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2023-02-17 08:23:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 08:23:43,178 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:43,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:43,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 08:23:43,179 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:43,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:43,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1556334460, now seen corresponding path program 1 times [2023-02-17 08:23:43,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:43,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130501301] [2023-02-17 08:23:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:43,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:43,254 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 08:23:43,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:43,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130501301] [2023-02-17 08:23:43,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130501301] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:43,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:43,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:23:43,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711997400] [2023-02-17 08:23:43,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:43,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:23:43,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:43,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:23:43,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:23:43,256 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 08:23:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:43,276 INFO L93 Difference]: Finished difference Result 192 states and 243 transitions. [2023-02-17 08:23:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:23:43,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-02-17 08:23:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:43,277 INFO L225 Difference]: With dead ends: 192 [2023-02-17 08:23:43,277 INFO L226 Difference]: Without dead ends: 192 [2023-02-17 08:23:43,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 08:23:43,278 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:43,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 216 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:23:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-17 08:23:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2023-02-17 08:23:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 143 states have (on average 1.6293706293706294) internal successors, (233), 178 states have internal predecessors, (233), 0 states have call successors, (0), 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 08:23:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 233 transitions. [2023-02-17 08:23:43,282 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 233 transitions. Word has length 16 [2023-02-17 08:23:43,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:43,282 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 233 transitions. [2023-02-17 08:23:43,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 08:23:43,282 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 233 transitions. [2023-02-17 08:23:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 08:23:43,283 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:43,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:43,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 08:23:43,284 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:43,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:43,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1356387674, now seen corresponding path program 1 times [2023-02-17 08:23:43,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:43,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926657620] [2023-02-17 08:23:43,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:43,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:43,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:43,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926657620] [2023-02-17 08:23:43,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926657620] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:43,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:43,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:23:43,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138926697] [2023-02-17 08:23:43,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:43,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:23:43,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:43,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:23:43,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:23:43,417 INFO L87 Difference]: Start difference. First operand 179 states and 233 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 08:23:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:43,585 INFO L93 Difference]: Finished difference Result 274 states and 343 transitions. [2023-02-17 08:23:43,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 08:23:43,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-02-17 08:23:43,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:43,587 INFO L225 Difference]: With dead ends: 274 [2023-02-17 08:23:43,587 INFO L226 Difference]: Without dead ends: 274 [2023-02-17 08:23:43,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:23:43,588 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 125 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:43,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 413 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:23:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-02-17 08:23:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 193. [2023-02-17 08:23:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 157 states have (on average 1.605095541401274) internal successors, (252), 192 states have internal predecessors, (252), 0 states have call successors, (0), 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 08:23:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 252 transitions. [2023-02-17 08:23:43,591 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 252 transitions. Word has length 16 [2023-02-17 08:23:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:43,591 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 252 transitions. [2023-02-17 08:23:43,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 08:23:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 252 transitions. [2023-02-17 08:23:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:23:43,592 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:43,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:43,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 08:23:43,593 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:43,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash -508929720, now seen corresponding path program 1 times [2023-02-17 08:23:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:43,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277259523] [2023-02-17 08:23:43,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:43,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:43,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:43,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277259523] [2023-02-17 08:23:43,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277259523] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:43,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:43,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:23:43,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594612179] [2023-02-17 08:23:43,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:43,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:23:43,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:43,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:23:43,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:23:43,716 INFO L87 Difference]: Start difference. First operand 193 states and 252 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:43,884 INFO L93 Difference]: Finished difference Result 273 states and 341 transitions. [2023-02-17 08:23:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:23:43,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-17 08:23:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:43,886 INFO L225 Difference]: With dead ends: 273 [2023-02-17 08:23:43,886 INFO L226 Difference]: Without dead ends: 273 [2023-02-17 08:23:43,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:23:43,886 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 128 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:43,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 417 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:23:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-17 08:23:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 228. [2023-02-17 08:23:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 192 states have (on average 1.609375) internal successors, (309), 227 states have internal predecessors, (309), 0 states have call successors, (0), 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 08:23:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 309 transitions. [2023-02-17 08:23:43,891 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 309 transitions. Word has length 17 [2023-02-17 08:23:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:43,891 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 309 transitions. [2023-02-17 08:23:43,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 309 transitions. [2023-02-17 08:23:43,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:23:43,892 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:43,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:43,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-17 08:23:43,893 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:43,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:43,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1001745105, now seen corresponding path program 1 times [2023-02-17 08:23:43,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:43,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034648071] [2023-02-17 08:23:43,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:43,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:43,924 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 08:23:43,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:43,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034648071] [2023-02-17 08:23:43,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034648071] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:43,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:43,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:23:43,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344773931] [2023-02-17 08:23:43,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:43,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:23:43,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:43,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:23:43,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:23:43,926 INFO L87 Difference]: Start difference. First operand 228 states and 309 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:44,022 INFO L93 Difference]: Finished difference Result 266 states and 328 transitions. [2023-02-17 08:23:44,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:23:44,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-17 08:23:44,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:44,023 INFO L225 Difference]: With dead ends: 266 [2023-02-17 08:23:44,023 INFO L226 Difference]: Without dead ends: 266 [2023-02-17 08:23:44,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:23:44,024 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 230 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:44,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 190 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:23:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-17 08:23:44,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 229. [2023-02-17 08:23:44,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 228 states have internal predecessors, (310), 0 states have call successors, (0), 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 08:23:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 310 transitions. [2023-02-17 08:23:44,029 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 310 transitions. Word has length 17 [2023-02-17 08:23:44,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:44,029 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 310 transitions. [2023-02-17 08:23:44,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 310 transitions. [2023-02-17 08:23:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 08:23:44,030 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:44,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:44,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-17 08:23:44,031 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:44,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793954, now seen corresponding path program 1 times [2023-02-17 08:23:44,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:44,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019038021] [2023-02-17 08:23:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:44,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:44,155 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 08:23:44,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:44,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019038021] [2023-02-17 08:23:44,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019038021] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:44,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:44,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:23:44,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086225032] [2023-02-17 08:23:44,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:44,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:23:44,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:44,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:23:44,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:23:44,157 INFO L87 Difference]: Start difference. First operand 229 states and 310 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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 08:23:44,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:44,248 INFO L93 Difference]: Finished difference Result 228 states and 308 transitions. [2023-02-17 08:23:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:23:44,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-17 08:23:44,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:44,249 INFO L225 Difference]: With dead ends: 228 [2023-02-17 08:23:44,249 INFO L226 Difference]: Without dead ends: 228 [2023-02-17 08:23:44,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:23:44,250 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 7 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:44,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 287 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:23:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-02-17 08:23:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2023-02-17 08:23:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 193 states have (on average 1.5958549222797926) internal successors, (308), 227 states have internal predecessors, (308), 0 states have call successors, (0), 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 08:23:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 308 transitions. [2023-02-17 08:23:44,255 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 308 transitions. Word has length 18 [2023-02-17 08:23:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:44,256 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 308 transitions. [2023-02-17 08:23:44,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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 08:23:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2023-02-17 08:23:44,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 08:23:44,258 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:44,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:44,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-17 08:23:44,258 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:44,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793955, now seen corresponding path program 1 times [2023-02-17 08:23:44,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:44,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274267311] [2023-02-17 08:23:44,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:44,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:44,427 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 08:23:44,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:44,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274267311] [2023-02-17 08:23:44,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274267311] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:44,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:44,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:23:44,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846770621] [2023-02-17 08:23:44,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:44,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:23:44,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:44,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:23:44,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:23:44,429 INFO L87 Difference]: Start difference. First operand 228 states and 308 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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 08:23:44,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:44,534 INFO L93 Difference]: Finished difference Result 227 states and 306 transitions. [2023-02-17 08:23:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:23:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-17 08:23:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:44,535 INFO L225 Difference]: With dead ends: 227 [2023-02-17 08:23:44,535 INFO L226 Difference]: Without dead ends: 227 [2023-02-17 08:23:44,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:23:44,537 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 5 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:44,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 264 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:23:44,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-17 08:23:44,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2023-02-17 08:23:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 193 states have (on average 1.5854922279792747) internal successors, (306), 226 states have internal predecessors, (306), 0 states have call successors, (0), 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 08:23:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2023-02-17 08:23:44,542 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 18 [2023-02-17 08:23:44,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:44,543 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2023-02-17 08:23:44,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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 08:23:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2023-02-17 08:23:44,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 08:23:44,546 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:44,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:44,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-17 08:23:44,547 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:44,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash 624480237, now seen corresponding path program 1 times [2023-02-17 08:23:44,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:44,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51305476] [2023-02-17 08:23:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:44,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:44,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:44,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51305476] [2023-02-17 08:23:44,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51305476] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:44,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:44,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:23:44,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825484882] [2023-02-17 08:23:44,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:44,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:23:44,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:44,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:23:44,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:23:44,611 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 08:23:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:44,753 INFO L93 Difference]: Finished difference Result 243 states and 325 transitions. [2023-02-17 08:23:44,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:23:44,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 19 [2023-02-17 08:23:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:44,755 INFO L225 Difference]: With dead ends: 243 [2023-02-17 08:23:44,755 INFO L226 Difference]: Without dead ends: 243 [2023-02-17 08:23:44,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:23:44,756 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 33 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:44,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 301 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:23:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-17 08:23:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 234. [2023-02-17 08:23:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 200 states have (on average 1.575) internal successors, (315), 233 states have internal predecessors, (315), 0 states have call successors, (0), 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 08:23:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 315 transitions. [2023-02-17 08:23:44,761 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 315 transitions. Word has length 19 [2023-02-17 08:23:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:44,762 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 315 transitions. [2023-02-17 08:23:44,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 08:23:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 315 transitions. [2023-02-17 08:23:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 08:23:44,763 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:44,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:44,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-17 08:23:44,763 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:44,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash 624664935, now seen corresponding path program 1 times [2023-02-17 08:23:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:44,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650700898] [2023-02-17 08:23:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:44,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:44,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:44,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650700898] [2023-02-17 08:23:44,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650700898] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:44,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:44,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 08:23:44,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827685237] [2023-02-17 08:23:44,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:44,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:23:44,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:44,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:23:44,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:23:44,927 INFO L87 Difference]: Start difference. First operand 234 states and 315 transitions. Second operand has 7 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 08:23:45,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:45,191 INFO L93 Difference]: Finished difference Result 339 states and 423 transitions. [2023-02-17 08:23:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 08:23:45,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 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 19 [2023-02-17 08:23:45,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:45,193 INFO L225 Difference]: With dead ends: 339 [2023-02-17 08:23:45,193 INFO L226 Difference]: Without dead ends: 339 [2023-02-17 08:23:45,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-17 08:23:45,194 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 289 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:45,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 418 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:23:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-02-17 08:23:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 289. [2023-02-17 08:23:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 255 states have (on average 1.5490196078431373) internal successors, (395), 288 states have internal predecessors, (395), 0 states have call successors, (0), 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 08:23:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 395 transitions. [2023-02-17 08:23:45,199 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 395 transitions. Word has length 19 [2023-02-17 08:23:45,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:45,199 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 395 transitions. [2023-02-17 08:23:45,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 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 08:23:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 395 transitions. [2023-02-17 08:23:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 08:23:45,200 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:45,200 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:45,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-17 08:23:45,201 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:45,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:45,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1555885541, now seen corresponding path program 1 times [2023-02-17 08:23:45,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:45,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503933166] [2023-02-17 08:23:45,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:45,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:45,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:45,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503933166] [2023-02-17 08:23:45,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503933166] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:45,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:45,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:23:45,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806539195] [2023-02-17 08:23:45,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:45,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:23:45,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:45,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:23:45,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:23:45,230 INFO L87 Difference]: Start difference. First operand 289 states and 395 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 08:23:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:45,237 INFO L93 Difference]: Finished difference Result 264 states and 344 transitions. [2023-02-17 08:23:45,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:23:45,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-17 08:23:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:45,239 INFO L225 Difference]: With dead ends: 264 [2023-02-17 08:23:45,239 INFO L226 Difference]: Without dead ends: 264 [2023-02-17 08:23:45,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 08:23:45,240 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:45,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 214 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:23:45,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-02-17 08:23:45,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2023-02-17 08:23:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 228 states have (on average 1.5087719298245614) internal successors, (344), 261 states have internal predecessors, (344), 0 states have call successors, (0), 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 08:23:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 344 transitions. [2023-02-17 08:23:45,245 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 344 transitions. Word has length 20 [2023-02-17 08:23:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:45,247 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 344 transitions. [2023-02-17 08:23:45,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 08:23:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 344 transitions. [2023-02-17 08:23:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 08:23:45,248 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:45,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:45,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-17 08:23:45,251 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:45,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:45,252 INFO L85 PathProgramCache]: Analyzing trace with hash 987811916, now seen corresponding path program 1 times [2023-02-17 08:23:45,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:45,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327222765] [2023-02-17 08:23:45,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:45,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:45,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:45,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327222765] [2023-02-17 08:23:45,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327222765] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:23:45,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020811093] [2023-02-17 08:23:45,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:45,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:23:45,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:23:45,361 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 08:23:45,382 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 08:23:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:45,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 08:23:45,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:23:45,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 15 treesize of output 14 [2023-02-17 08:23:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:45,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:23:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:45,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020811093] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:23:45,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:23:45,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-17 08:23:45,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353599921] [2023-02-17 08:23:45,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:23:45,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:23:45,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:45,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:23:45,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:23:45,628 INFO L87 Difference]: Start difference. First operand 262 states and 344 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 08:23:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:45,813 INFO L93 Difference]: Finished difference Result 275 states and 357 transitions. [2023-02-17 08:23:45,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:23:45,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 21 [2023-02-17 08:23:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:45,814 INFO L225 Difference]: With dead ends: 275 [2023-02-17 08:23:45,815 INFO L226 Difference]: Without dead ends: 259 [2023-02-17 08:23:45,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:23:45,815 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 40 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:45,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 284 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:23:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-02-17 08:23:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2023-02-17 08:23:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 223 states have (on average 1.515695067264574) internal successors, (338), 256 states have internal predecessors, (338), 0 states have call successors, (0), 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 08:23:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 338 transitions. [2023-02-17 08:23:45,820 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 338 transitions. Word has length 21 [2023-02-17 08:23:45,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:45,820 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 338 transitions. [2023-02-17 08:23:45,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 08:23:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 338 transitions. [2023-02-17 08:23:45,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 08:23:45,823 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:45,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:45,829 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 08:23:46,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-17 08:23:46,028 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:46,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:46,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983029, now seen corresponding path program 1 times [2023-02-17 08:23:46,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:46,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637265718] [2023-02-17 08:23:46,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:46,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:46,167 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 08:23:46,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:46,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637265718] [2023-02-17 08:23:46,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637265718] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:46,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:46,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 08:23:46,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47677622] [2023-02-17 08:23:46,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:46,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:23:46,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:46,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:23:46,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:23:46,170 INFO L87 Difference]: Start difference. First operand 257 states and 338 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 08:23:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:46,407 INFO L93 Difference]: Finished difference Result 258 states and 337 transitions. [2023-02-17 08:23:46,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:23:46,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 21 [2023-02-17 08:23:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:46,409 INFO L225 Difference]: With dead ends: 258 [2023-02-17 08:23:46,409 INFO L226 Difference]: Without dead ends: 258 [2023-02-17 08:23:46,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-17 08:23:46,410 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 92 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:46,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 277 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:23:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-02-17 08:23:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2023-02-17 08:23:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 223 states have (on average 1.5022421524663676) internal successors, (335), 255 states have internal predecessors, (335), 0 states have call successors, (0), 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 08:23:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 335 transitions. [2023-02-17 08:23:46,415 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 335 transitions. Word has length 21 [2023-02-17 08:23:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:46,415 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 335 transitions. [2023-02-17 08:23:46,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 08:23:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 335 transitions. [2023-02-17 08:23:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 08:23:46,416 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:46,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:46,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-17 08:23:46,416 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983030, now seen corresponding path program 1 times [2023-02-17 08:23:46,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:46,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973717236] [2023-02-17 08:23:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:46,612 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 08:23:46,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:46,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973717236] [2023-02-17 08:23:46,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973717236] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:46,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:46,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 08:23:46,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460586676] [2023-02-17 08:23:46,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:46,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:23:46,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:46,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:23:46,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:23:46,614 INFO L87 Difference]: Start difference. First operand 256 states and 335 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 08:23:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:46,836 INFO L93 Difference]: Finished difference Result 257 states and 334 transitions. [2023-02-17 08:23:46,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:23:46,836 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 21 [2023-02-17 08:23:46,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:46,837 INFO L225 Difference]: With dead ends: 257 [2023-02-17 08:23:46,837 INFO L226 Difference]: Without dead ends: 257 [2023-02-17 08:23:46,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-17 08:23:46,838 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 92 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:46,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 222 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:23:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-02-17 08:23:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2023-02-17 08:23:46,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 223 states have (on average 1.4887892376681615) internal successors, (332), 254 states have internal predecessors, (332), 0 states have call successors, (0), 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 08:23:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 332 transitions. [2023-02-17 08:23:46,842 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 332 transitions. Word has length 21 [2023-02-17 08:23:46,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:46,842 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 332 transitions. [2023-02-17 08:23:46,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 08:23:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 332 transitions. [2023-02-17 08:23:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 08:23:46,843 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:46,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:46,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-17 08:23:46,843 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:46,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash 27790463, now seen corresponding path program 1 times [2023-02-17 08:23:46,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:46,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867487566] [2023-02-17 08:23:46,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:46,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:46,929 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 08:23:46,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:46,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867487566] [2023-02-17 08:23:46,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867487566] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:46,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:46,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:23:46,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484391455] [2023-02-17 08:23:46,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:46,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:23:46,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:46,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:23:46,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:23:46,932 INFO L87 Difference]: Start difference. First operand 255 states and 332 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 08:23:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:47,024 INFO L93 Difference]: Finished difference Result 254 states and 330 transitions. [2023-02-17 08:23:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:23:47,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2023-02-17 08:23:47,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:47,026 INFO L225 Difference]: With dead ends: 254 [2023-02-17 08:23:47,026 INFO L226 Difference]: Without dead ends: 254 [2023-02-17 08:23:47,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:23:47,027 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:47,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 277 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:23:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-02-17 08:23:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2023-02-17 08:23:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 223 states have (on average 1.4798206278026906) internal successors, (330), 253 states have internal predecessors, (330), 0 states have call successors, (0), 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 08:23:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 330 transitions. [2023-02-17 08:23:47,031 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 330 transitions. Word has length 22 [2023-02-17 08:23:47,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:47,031 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 330 transitions. [2023-02-17 08:23:47,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 08:23:47,032 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 330 transitions. [2023-02-17 08:23:47,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 08:23:47,032 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:47,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:47,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-17 08:23:47,033 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:47,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:47,033 INFO L85 PathProgramCache]: Analyzing trace with hash 27790464, now seen corresponding path program 1 times [2023-02-17 08:23:47,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:47,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642918394] [2023-02-17 08:23:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:47,137 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 08:23:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:47,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642918394] [2023-02-17 08:23:47,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642918394] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:47,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:47,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:23:47,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717101385] [2023-02-17 08:23:47,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:47,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:23:47,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:47,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:23:47,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:23:47,139 INFO L87 Difference]: Start difference. First operand 254 states and 330 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 08:23:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:47,245 INFO L93 Difference]: Finished difference Result 253 states and 328 transitions. [2023-02-17 08:23:47,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:23:47,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2023-02-17 08:23:47,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:47,247 INFO L225 Difference]: With dead ends: 253 [2023-02-17 08:23:47,247 INFO L226 Difference]: Without dead ends: 253 [2023-02-17 08:23:47,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:23:47,248 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:47,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 254 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:23:47,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-17 08:23:47,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2023-02-17 08:23:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 223 states have (on average 1.4708520179372198) internal successors, (328), 252 states have internal predecessors, (328), 0 states have call successors, (0), 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 08:23:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 328 transitions. [2023-02-17 08:23:47,253 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 328 transitions. Word has length 22 [2023-02-17 08:23:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:47,253 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 328 transitions. [2023-02-17 08:23:47,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 08:23:47,253 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 328 transitions. [2023-02-17 08:23:47,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 08:23:47,253 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:47,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:47,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-17 08:23:47,254 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:47,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:47,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919462, now seen corresponding path program 1 times [2023-02-17 08:23:47,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:47,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623073852] [2023-02-17 08:23:47,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:47,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:47,389 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 08:23:47,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:47,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623073852] [2023-02-17 08:23:47,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623073852] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:47,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:47,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 08:23:47,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002334712] [2023-02-17 08:23:47,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:47,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:23:47,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:47,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:23:47,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:23:47,393 INFO L87 Difference]: Start difference. First operand 253 states and 328 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 08:23:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:47,598 INFO L93 Difference]: Finished difference Result 254 states and 329 transitions. [2023-02-17 08:23:47,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:23:47,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-02-17 08:23:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:47,600 INFO L225 Difference]: With dead ends: 254 [2023-02-17 08:23:47,600 INFO L226 Difference]: Without dead ends: 254 [2023-02-17 08:23:47,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-17 08:23:47,601 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 84 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:47,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 228 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:23:47,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-02-17 08:23:47,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2023-02-17 08:23:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 223 states have (on average 1.4663677130044843) internal successors, (327), 251 states have internal predecessors, (327), 0 states have call successors, (0), 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 08:23:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 327 transitions. [2023-02-17 08:23:47,606 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 327 transitions. Word has length 25 [2023-02-17 08:23:47,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:47,606 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 327 transitions. [2023-02-17 08:23:47,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 08:23:47,606 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 327 transitions. [2023-02-17 08:23:47,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 08:23:47,606 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:47,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:47,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-17 08:23:47,607 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:47,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:47,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919461, now seen corresponding path program 1 times [2023-02-17 08:23:47,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:47,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843185126] [2023-02-17 08:23:47,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:47,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:47,823 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 08:23:47,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:47,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843185126] [2023-02-17 08:23:47,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843185126] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:47,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:47,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 08:23:47,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310571016] [2023-02-17 08:23:47,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:47,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:23:47,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:47,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:23:47,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:23:47,825 INFO L87 Difference]: Start difference. First operand 252 states and 327 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 08:23:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:48,059 INFO L93 Difference]: Finished difference Result 253 states and 328 transitions. [2023-02-17 08:23:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:23:48,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-02-17 08:23:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:48,061 INFO L225 Difference]: With dead ends: 253 [2023-02-17 08:23:48,062 INFO L226 Difference]: Without dead ends: 253 [2023-02-17 08:23:48,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-17 08:23:48,062 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 81 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:48,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 255 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:23:48,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-17 08:23:48,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2023-02-17 08:23:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 223 states have (on average 1.4618834080717489) internal successors, (326), 250 states have internal predecessors, (326), 0 states have call successors, (0), 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 08:23:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 326 transitions. [2023-02-17 08:23:48,067 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 326 transitions. Word has length 25 [2023-02-17 08:23:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:48,067 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 326 transitions. [2023-02-17 08:23:48,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 08:23:48,068 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 326 transitions. [2023-02-17 08:23:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 08:23:48,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:48,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:48,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-17 08:23:48,069 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:48,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash -756843594, now seen corresponding path program 1 times [2023-02-17 08:23:48,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:48,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349847149] [2023-02-17 08:23:48,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:48,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:48,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:48,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349847149] [2023-02-17 08:23:48,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349847149] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:23:48,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464751948] [2023-02-17 08:23:48,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:48,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:23:48,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:23:48,677 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 08:23:48,681 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 08:23:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:48,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 08:23:48,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:23:48,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-02-17 08:23:48,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:48,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2023-02-17 08:23:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:49,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:23:49,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:49,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 59 [2023-02-17 08:23:49,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:49,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 53 [2023-02-17 08:23:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:49,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464751948] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:23:49,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:23:49,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 33 [2023-02-17 08:23:49,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835848183] [2023-02-17 08:23:49,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:23:49,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-17 08:23:49,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:49,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-17 08:23:49,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2023-02-17 08:23:49,403 INFO L87 Difference]: Start difference. First operand 251 states and 326 transitions. Second operand has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 0 states have call successors, (0), 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 08:23:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:51,057 INFO L93 Difference]: Finished difference Result 385 states and 466 transitions. [2023-02-17 08:23:51,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-17 08:23:51,057 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 0 states have call successors, (0), 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 08:23:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:51,059 INFO L225 Difference]: With dead ends: 385 [2023-02-17 08:23:51,059 INFO L226 Difference]: Without dead ends: 385 [2023-02-17 08:23:51,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=977, Invalid=3055, Unknown=0, NotChecked=0, Total=4032 [2023-02-17 08:23:51,061 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 644 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:51,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1234 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-17 08:23:51,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-02-17 08:23:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 251. [2023-02-17 08:23:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 223 states have (on average 1.4035874439461884) internal successors, (313), 250 states have internal predecessors, (313), 0 states have call successors, (0), 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 08:23:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 313 transitions. [2023-02-17 08:23:51,066 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 313 transitions. Word has length 38 [2023-02-17 08:23:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:51,066 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 313 transitions. [2023-02-17 08:23:51,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 0 states have call successors, (0), 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 08:23:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 313 transitions. [2023-02-17 08:23:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 08:23:51,067 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:51,067 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:51,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 08:23:51,272 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,SelfDestructingSolverStorable23 [2023-02-17 08:23:51,273 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:51,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:51,273 INFO L85 PathProgramCache]: Analyzing trace with hash 734177974, now seen corresponding path program 1 times [2023-02-17 08:23:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:51,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624012454] [2023-02-17 08:23:51,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:51,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:51,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:51,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624012454] [2023-02-17 08:23:51,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624012454] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:23:51,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164540031] [2023-02-17 08:23:51,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:51,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:23:51,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:23:51,600 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 08:23:51,624 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 08:23:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:51,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-17 08:23:51,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:23:51,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:51,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:23:51,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:23:51,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-17 08:23:51,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:23:51,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2023-02-17 08:23:51,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:51,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 55 [2023-02-17 08:23:51,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 20 [2023-02-17 08:23:51,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:51,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 55 [2023-02-17 08:23:51,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 20 [2023-02-17 08:23:51,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-17 08:23:51,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:51,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 46 [2023-02-17 08:23:51,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:23:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:51,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:23:51,988 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_549 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_549) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2023-02-17 08:23:51,992 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~n~0#1.offset|)))) (and (forall ((v_ArrVal_549 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_549) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2023-02-17 08:23:52,000 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_546) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_547))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_549)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2023-02-17 08:23:52,006 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_549)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_546) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_547) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2023-02-17 08:23:52,017 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc20#1.base|)))) (and (forall ((v_ArrVal_544 Int) (v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 v_ArrVal_544)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_546) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (= (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_547))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_549)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2023-02-17 08:23:52,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:52,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 112 [2023-02-17 08:23:52,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:52,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 109 [2023-02-17 08:23:52,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 118 [2023-02-17 08:23:52,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 96 [2023-02-17 08:23:52,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:52,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 228 [2023-02-17 08:23:52,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 208 [2023-02-17 08:23:52,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 198 [2023-02-17 08:23:52,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 174 [2023-02-17 08:23:52,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:52,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 205 [2023-02-17 08:23:52,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:52,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 538 treesize of output 382 [2023-02-17 08:23:52,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 337 treesize of output 329 [2023-02-17 08:23:52,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:52,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 329 treesize of output 312 [2023-02-17 08:23:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:52,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164540031] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:23:52,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:23:52,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 34 [2023-02-17 08:23:52,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510273107] [2023-02-17 08:23:52,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:23:52,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-17 08:23:52,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:52,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-17 08:23:52,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=673, Unknown=5, NotChecked=290, Total=1122 [2023-02-17 08:23:52,608 INFO L87 Difference]: Start difference. First operand 251 states and 313 transitions. Second operand has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 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 08:23:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:54,190 INFO L93 Difference]: Finished difference Result 511 states and 634 transitions. [2023-02-17 08:23:54,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-17 08:23:54,190 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 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 08:23:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:54,192 INFO L225 Difference]: With dead ends: 511 [2023-02-17 08:23:54,192 INFO L226 Difference]: Without dead ends: 511 [2023-02-17 08:23:54,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=507, Invalid=1670, Unknown=5, NotChecked=470, Total=2652 [2023-02-17 08:23:54,193 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 467 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 2759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1229 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:54,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1350 Invalid, 2759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1489 Invalid, 0 Unknown, 1229 Unchecked, 1.2s Time] [2023-02-17 08:23:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-02-17 08:23:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 300. [2023-02-17 08:23:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 272 states have (on average 1.3786764705882353) internal successors, (375), 299 states have internal predecessors, (375), 0 states have call successors, (0), 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 08:23:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 375 transitions. [2023-02-17 08:23:54,200 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 375 transitions. Word has length 38 [2023-02-17 08:23:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:54,200 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 375 transitions. [2023-02-17 08:23:54,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 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 08:23:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 375 transitions. [2023-02-17 08:23:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 08:23:54,202 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:54,202 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:54,211 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 08:23:54,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:23:54,409 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:54,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:54,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1594589588, now seen corresponding path program 1 times [2023-02-17 08:23:54,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:54,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395918424] [2023-02-17 08:23:54,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:54,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:54,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:54,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395918424] [2023-02-17 08:23:54,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395918424] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:23:54,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241207206] [2023-02-17 08:23:54,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:54,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:23:54,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:23:54,687 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 08:23:54,688 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 08:23:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:54,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-17 08:23:54,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:23:54,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:54,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:23:54,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:23:54,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:54,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 36 [2023-02-17 08:23:54,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:54,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 43 [2023-02-17 08:23:54,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:54,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2023-02-17 08:23:54,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:23:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:54,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:23:54,993 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:54,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2023-02-17 08:23:55,012 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_621) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) .cse0))) is different from false [2023-02-17 08:23:55,015 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_620))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_621) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) .cse1)))) is different from false [2023-02-17 08:23:55,018 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_620))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_621) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) .cse1)))) is different from false [2023-02-17 08:23:55,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:55,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2023-02-17 08:23:55,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:55,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 137 [2023-02-17 08:23:55,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2023-02-17 08:23:55,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:55,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 102 [2023-02-17 08:23:55,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:55,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 158 [2023-02-17 08:23:55,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:55,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241207206] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:23:55,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:23:55,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2023-02-17 08:23:55,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020951500] [2023-02-17 08:23:55,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:23:55,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-17 08:23:55,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:55,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-17 08:23:55,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=508, Unknown=5, NotChecked=144, Total=756 [2023-02-17 08:23:55,168 INFO L87 Difference]: Start difference. First operand 300 states and 375 transitions. Second operand has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:55,956 INFO L93 Difference]: Finished difference Result 519 states and 653 transitions. [2023-02-17 08:23:55,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 08:23:55,956 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-17 08:23:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:55,958 INFO L225 Difference]: With dead ends: 519 [2023-02-17 08:23:55,958 INFO L226 Difference]: Without dead ends: 519 [2023-02-17 08:23:55,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=1088, Unknown=5, NotChecked=222, Total=1640 [2023-02-17 08:23:55,959 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 642 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 633 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:55,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 755 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1023 Invalid, 0 Unknown, 633 Unchecked, 0.6s Time] [2023-02-17 08:23:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2023-02-17 08:23:55,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 402. [2023-02-17 08:23:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 374 states have (on average 1.3877005347593583) internal successors, (519), 401 states have internal predecessors, (519), 0 states have call successors, (0), 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 08:23:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 519 transitions. [2023-02-17 08:23:55,991 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 519 transitions. Word has length 39 [2023-02-17 08:23:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:55,992 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 519 transitions. [2023-02-17 08:23:55,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 519 transitions. [2023-02-17 08:23:55,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 08:23:55,993 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:55,993 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:56,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 08:23:56,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-17 08:23:56,201 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:56,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:56,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1594589587, now seen corresponding path program 1 times [2023-02-17 08:23:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:56,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598801522] [2023-02-17 08:23:56,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:56,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:56,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:56,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598801522] [2023-02-17 08:23:56,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598801522] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:23:56,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988049994] [2023-02-17 08:23:56,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:56,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:23:56,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:23:56,564 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 08:23:56,586 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 08:23:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:56,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-17 08:23:56,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:23:56,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:56,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:23:56,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 08:23:56,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:23:56,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:23:56,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:56,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 51 [2023-02-17 08:23:56,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 18 [2023-02-17 08:23:56,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:56,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 51 [2023-02-17 08:23:56,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 18 [2023-02-17 08:23:56,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:56,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2023-02-17 08:23:56,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-02-17 08:23:56,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:23:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:56,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:23:57,039 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_698 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) is different from false [2023-02-17 08:23:57,047 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_696) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_695) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_695))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_696) .cse0 v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))))) is different from false [2023-02-17 08:23:57,053 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_695))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_696) .cse1 v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_696) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_695) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2023-02-17 08:23:57,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:57,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-17 08:23:57,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:57,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-17 08:23:57,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2023-02-17 08:23:57,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:57,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 99 [2023-02-17 08:23:57,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2023-02-17 08:23:57,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2023-02-17 08:23:57,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2023-02-17 08:23:57,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:57,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2023-02-17 08:23:57,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:57,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2023-02-17 08:23:57,110 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:23:57,110 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:23:57,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2023-02-17 08:23:57,115 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:23:57,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-02-17 08:23:57,120 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 08:23:57,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:23:57,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 94 [2023-02-17 08:23:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:57,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988049994] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:23:57,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:23:57,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2023-02-17 08:23:57,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717002391] [2023-02-17 08:23:57,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:23:57,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-17 08:23:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:57,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-17 08:23:57,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=792, Unknown=14, NotChecked=180, Total=1122 [2023-02-17 08:23:57,198 INFO L87 Difference]: Start difference. First operand 402 states and 519 transitions. Second operand has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 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 08:23:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:58,500 INFO L93 Difference]: Finished difference Result 623 states and 773 transitions. [2023-02-17 08:23:58,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-17 08:23:58,500 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 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 39 [2023-02-17 08:23:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:58,502 INFO L225 Difference]: With dead ends: 623 [2023-02-17 08:23:58,502 INFO L226 Difference]: Without dead ends: 623 [2023-02-17 08:23:58,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=626, Invalid=2339, Unknown=17, NotChecked=324, Total=3306 [2023-02-17 08:23:58,504 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 1037 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 852 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:58,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 983 Invalid, 2286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1350 Invalid, 0 Unknown, 852 Unchecked, 0.8s Time] [2023-02-17 08:23:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-02-17 08:23:58,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 417. [2023-02-17 08:23:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 395 states have (on average 1.3822784810126583) internal successors, (546), 416 states have internal predecessors, (546), 0 states have call successors, (0), 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 08:23:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 546 transitions. [2023-02-17 08:23:58,514 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 546 transitions. Word has length 39 [2023-02-17 08:23:58,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:58,515 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 546 transitions. [2023-02-17 08:23:58,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 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 08:23:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 546 transitions. [2023-02-17 08:23:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 08:23:58,516 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:58,516 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:58,529 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 08:23:58,724 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,SelfDestructingSolverStorable26 [2023-02-17 08:23:58,725 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:58,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1594404890, now seen corresponding path program 1 times [2023-02-17 08:23:58,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:58,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351505312] [2023-02-17 08:23:58,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:58,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:58,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:23:58,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:58,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351505312] [2023-02-17 08:23:58,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351505312] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:58,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:58,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:23:58,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114567706] [2023-02-17 08:23:58,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:58,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:23:58,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:58,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:23:58,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:23:58,809 INFO L87 Difference]: Start difference. First operand 417 states and 546 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:58,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:58,929 INFO L93 Difference]: Finished difference Result 417 states and 540 transitions. [2023-02-17 08:23:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:23:58,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-17 08:23:58,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:58,931 INFO L225 Difference]: With dead ends: 417 [2023-02-17 08:23:58,931 INFO L226 Difference]: Without dead ends: 417 [2023-02-17 08:23:58,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:23:58,932 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 12 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:58,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 299 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:23:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-02-17 08:23:58,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 411. [2023-02-17 08:23:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 389 states have (on average 1.3727506426735219) internal successors, (534), 410 states have internal predecessors, (534), 0 states have call successors, (0), 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 08:23:58,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 534 transitions. [2023-02-17 08:23:58,940 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 534 transitions. Word has length 39 [2023-02-17 08:23:58,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:58,941 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 534 transitions. [2023-02-17 08:23:58,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 534 transitions. [2023-02-17 08:23:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 08:23:58,942 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:58,942 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:58,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-17 08:23:58,942 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:58,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:58,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1677406060, now seen corresponding path program 1 times [2023-02-17 08:23:58,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:58,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971107755] [2023-02-17 08:23:58,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:23:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:23:59,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:23:59,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971107755] [2023-02-17 08:23:59,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971107755] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:23:59,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:23:59,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-17 08:23:59,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208644] [2023-02-17 08:23:59,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:23:59,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 08:23:59,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:23:59,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 08:23:59,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-17 08:23:59,263 INFO L87 Difference]: Start difference. First operand 411 states and 534 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:23:59,769 INFO L93 Difference]: Finished difference Result 549 states and 686 transitions. [2023-02-17 08:23:59,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 08:23:59,770 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-17 08:23:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:23:59,772 INFO L225 Difference]: With dead ends: 549 [2023-02-17 08:23:59,772 INFO L226 Difference]: Without dead ends: 549 [2023-02-17 08:23:59,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2023-02-17 08:23:59,773 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 178 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:23:59,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 832 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:23:59,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2023-02-17 08:23:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 424. [2023-02-17 08:23:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 402 states have (on average 1.3830845771144278) internal successors, (556), 423 states have internal predecessors, (556), 0 states have call successors, (0), 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 08:23:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 556 transitions. [2023-02-17 08:23:59,782 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 556 transitions. Word has length 39 [2023-02-17 08:23:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:23:59,782 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 556 transitions. [2023-02-17 08:23:59,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:23:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 556 transitions. [2023-02-17 08:23:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 08:23:59,783 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:23:59,783 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:23:59,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-17 08:23:59,783 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-17 08:23:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:23:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1454341771, now seen corresponding path program 1 times [2023-02-17 08:23:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:23:59,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646763404] [2023-02-17 08:23:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:23:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:23:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:00,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:00,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646763404] [2023-02-17 08:24:00,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646763404] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:24:00,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318811779] [2023-02-17 08:24:00,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:00,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:24:00,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:24:00,226 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 08:24:00,229 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 08:24:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:00,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-17 08:24:00,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:00,367 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:24:00,377 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:24:00,387 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:24:00,397 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:24:00,407 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:24:00,416 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:24:00,426 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:24:00,435 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:24:00,444 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:24:00,454 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:24:00,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:00,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2023-02-17 08:24:00,468 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:24:00,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:00,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:00,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 76 [2023-02-17 08:24:00,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:00,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 76 [2023-02-17 08:24:00,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:00,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 79 [2023-02-17 08:24:00,677 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:24:00,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 32 [2023-02-17 08:24:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:00,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:01,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:01,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2023-02-17 08:24:01,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:01,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 255 [2023-02-17 08:24:01,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 220 [2023-02-17 08:24:01,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:01,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 200 [2023-02-17 08:24:16,323 INFO L217 Elim1Store]: Index analysis took 105 ms [2023-02-17 08:24:28,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:32,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 962 select indices, 962 select index equivalence classes, 0 disjoint index pairs (out of 462241 index pairs), introduced 962 new quantified variables, introduced 462241 case distinctions, treesize of input 17225 treesize of output 3712979