./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.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 b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 05:21:22,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 05:21:22,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 05:21:22,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 05:21:22,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 05:21:22,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 05:21:22,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 05:21:22,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 05:21:22,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 05:21:22,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 05:21:22,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 05:21:22,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 05:21:22,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 05:21:22,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 05:21:22,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 05:21:22,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 05:21:22,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 05:21:22,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 05:21:22,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 05:21:22,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 05:21:22,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 05:21:22,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 05:21:22,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 05:21:22,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 05:21:22,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 05:21:22,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 05:21:22,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 05:21:22,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 05:21:22,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 05:21:22,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 05:21:22,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 05:21:22,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 05:21:22,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 05:21:22,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 05:21:22,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 05:21:22,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 05:21:22,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 05:21:22,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 05:21:22,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 05:21:22,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 05:21:22,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 05:21:22,830 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-18 05:21:22,852 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 05:21:22,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 05:21:22,853 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 05:21:22,853 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 05:21:22,854 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 05:21:22,854 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 05:21:22,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 05:21:22,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 05:21:22,854 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 05:21:22,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 05:21:22,855 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 05:21:22,855 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 05:21:22,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 05:21:22,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 05:21:22,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 05:21:22,856 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 05:21:22,856 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 05:21:22,856 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 05:21:22,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 05:21:22,856 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 05:21:22,856 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 05:21:22,857 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 05:21:22,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 05:21:22,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 05:21:22,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 05:21:22,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 05:21:22,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 05:21:22,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 05:21:22,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 05:21:22,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 05:21:22,858 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 05:21:22,858 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 05:21:22,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 05:21:22,859 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 05:21:22,859 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 -> b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 [2023-02-18 05:21:23,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 05:21:23,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 05:21:23,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 05:21:23,069 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 05:21:23,069 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 05:21:23,070 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2023-02-18 05:21:23,989 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 05:21:24,188 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 05:21:24,193 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2023-02-18 05:21:24,200 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb77dcfd1/25b4b41f0da4456882cc45816de3315c/FLAGbc80d4cd2 [2023-02-18 05:21:24,209 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb77dcfd1/25b4b41f0da4456882cc45816de3315c [2023-02-18 05:21:24,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 05:21:24,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 05:21:24,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 05:21:24,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 05:21:24,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 05:21:24,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 05:21:24" (1/1) ... [2023-02-18 05:21:24,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e961437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:21:24, skipping insertion in model container [2023-02-18 05:21:24,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 05:21:24" (1/1) ... [2023-02-18 05:21:24,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 05:21:24,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 05:21:24,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 05:21:24,398 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 05:21:24,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 05:21:24,460 INFO L208 MainTranslator]: Completed translation [2023-02-18 05:21:24,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:21:24 WrapperNode [2023-02-18 05:21:24,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 05:21:24,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 05:21:24,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 05:21:24,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 05:21:24,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:21:24" (1/1) ... [2023-02-18 05:21:24,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:21:24" (1/1) ... [2023-02-18 05:21:24,506 INFO L138 Inliner]: procedures = 123, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2023-02-18 05:21:24,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 05:21:24,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 05:21:24,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 05:21:24,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 05:21:24,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:21:24" (1/1) ... [2023-02-18 05:21:24,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:21:24" (1/1) ... [2023-02-18 05:21:24,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:21:24" (1/1) ... [2023-02-18 05:21:24,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:21:24" (1/1) ... [2023-02-18 05:21:24,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:21:24" (1/1) ... [2023-02-18 05:21:24,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:21:24" (1/1) ... [2023-02-18 05:21:24,540 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:21:24" (1/1) ... [2023-02-18 05:21:24,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:21:24" (1/1) ... [2023-02-18 05:21:24,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 05:21:24,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 05:21:24,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 05:21:24,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 05:21:24,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:21:24" (1/1) ... [2023-02-18 05:21:24,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 05:21:24,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:21:24,566 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-18 05:21:24,573 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-18 05:21:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 05:21:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 05:21:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-18 05:21:24,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-18 05:21:24,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-18 05:21:24,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 05:21:24,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 05:21:24,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 05:21:24,664 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 05:21:24,666 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 05:21:24,792 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 05:21:24,796 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 05:21:24,796 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 05:21:24,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:21:24 BoogieIcfgContainer [2023-02-18 05:21:24,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 05:21:24,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 05:21:24,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 05:21:24,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 05:21:24,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 05:21:24" (1/3) ... [2023-02-18 05:21:24,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c42e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 05:21:24, skipping insertion in model container [2023-02-18 05:21:24,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:21:24" (2/3) ... [2023-02-18 05:21:24,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c42e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 05:21:24, skipping insertion in model container [2023-02-18 05:21:24,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:21:24" (3/3) ... [2023-02-18 05:21:24,803 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2023-02-18 05:21:24,814 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 05:21:24,814 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2023-02-18 05:21:24,841 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 05:21:24,846 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;@6b5ac55d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 05:21:24,846 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2023-02-18 05:21:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 31 states have (on average 2.064516129032258) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:24,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-18 05:21:24,852 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:24,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-18 05:21:24,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:24,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:24,857 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-18 05:21:24,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:24,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659779956] [2023-02-18 05:21:24,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:24,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:25,043 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-18 05:21:25,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:25,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659779956] [2023-02-18 05:21:25,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659779956] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:21:25,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:21:25,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 05:21:25,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312257778] [2023-02-18 05:21:25,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:21:25,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 05:21:25,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:25,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 05:21:25,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 05:21:25,102 INFO L87 Difference]: Start difference. First operand has 59 states, 31 states have (on average 2.064516129032258) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-18 05:21:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:25,211 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2023-02-18 05:21:25,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 05:21:25,213 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-18 05:21:25,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:25,218 INFO L225 Difference]: With dead ends: 63 [2023-02-18 05:21:25,219 INFO L226 Difference]: Without dead ends: 59 [2023-02-18 05:21:25,220 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-18 05:21:25,223 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:25,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 05:21:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-18 05:21:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2023-02-18 05:21:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2023-02-18 05:21:25,251 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 3 [2023-02-18 05:21:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:25,252 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2023-02-18 05:21:25,252 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-18 05:21:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2023-02-18 05:21:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-18 05:21:25,253 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:25,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-18 05:21:25,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 05:21:25,254 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:25,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:25,256 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-18 05:21:25,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:25,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674557437] [2023-02-18 05:21:25,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:25,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:25,344 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-18 05:21:25,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:25,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674557437] [2023-02-18 05:21:25,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674557437] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:21:25,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:21:25,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 05:21:25,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004985100] [2023-02-18 05:21:25,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:21:25,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 05:21:25,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:25,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 05:21:25,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 05:21:25,349 INFO L87 Difference]: Start difference. First operand 53 states and 58 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-18 05:21:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:25,406 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2023-02-18 05:21:25,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 05:21:25,406 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-18 05:21:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:25,407 INFO L225 Difference]: With dead ends: 55 [2023-02-18 05:21:25,407 INFO L226 Difference]: Without dead ends: 55 [2023-02-18 05:21:25,411 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-18 05:21:25,412 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:25,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 05:21:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-18 05:21:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2023-02-18 05:21:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.606060606060606) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2023-02-18 05:21:25,419 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 3 [2023-02-18 05:21:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:25,419 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2023-02-18 05:21:25,419 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-18 05:21:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2023-02-18 05:21:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-18 05:21:25,420 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:25,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:21:25,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 05:21:25,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:25,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:25,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897518, now seen corresponding path program 1 times [2023-02-18 05:21:25,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:25,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528812938] [2023-02-18 05:21:25,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:25,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:25,523 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-18 05:21:25,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:25,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528812938] [2023-02-18 05:21:25,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528812938] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:21:25,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:21:25,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 05:21:25,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760715995] [2023-02-18 05:21:25,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:21:25,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 05:21:25,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:25,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 05:21:25,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 05:21:25,525 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:25,584 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2023-02-18 05:21:25,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 05:21:25,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-18 05:21:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:25,586 INFO L225 Difference]: With dead ends: 58 [2023-02-18 05:21:25,586 INFO L226 Difference]: Without dead ends: 58 [2023-02-18 05:21:25,586 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-18 05:21:25,587 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:25,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 31 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 05:21:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-18 05:21:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2023-02-18 05:21:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2023-02-18 05:21:25,591 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 10 [2023-02-18 05:21:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:25,591 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2023-02-18 05:21:25,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2023-02-18 05:21:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-18 05:21:25,592 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:25,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:21:25,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 05:21:25,592 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:25,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:25,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897519, now seen corresponding path program 1 times [2023-02-18 05:21:25,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:25,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684510885] [2023-02-18 05:21:25,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:25,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:25,699 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-18 05:21:25,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:25,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684510885] [2023-02-18 05:21:25,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684510885] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:21:25,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:21:25,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 05:21:25,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196500187] [2023-02-18 05:21:25,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:21:25,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 05:21:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:25,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 05:21:25,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 05:21:25,701 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:25,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:25,769 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2023-02-18 05:21:25,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 05:21:25,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-18 05:21:25,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:25,770 INFO L225 Difference]: With dead ends: 87 [2023-02-18 05:21:25,771 INFO L226 Difference]: Without dead ends: 87 [2023-02-18 05:21:25,771 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-18 05:21:25,772 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:25,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 53 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 05:21:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-18 05:21:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2023-02-18 05:21:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.528301886792453) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2023-02-18 05:21:25,776 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 10 [2023-02-18 05:21:25,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:25,776 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-02-18 05:21:25,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:25,776 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2023-02-18 05:21:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 05:21:25,777 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:25,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:21:25,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 05:21:25,777 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:25,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:25,778 INFO L85 PathProgramCache]: Analyzing trace with hash 233083786, now seen corresponding path program 1 times [2023-02-18 05:21:25,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:25,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111134542] [2023-02-18 05:21:25,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:25,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:25,806 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-18 05:21:25,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:25,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111134542] [2023-02-18 05:21:25,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111134542] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:21:25,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:21:25,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 05:21:25,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706336982] [2023-02-18 05:21:25,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:21:25,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 05:21:25,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:25,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 05:21:25,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 05:21:25,809 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:25,847 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2023-02-18 05:21:25,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 05:21:25,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-18 05:21:25,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:25,848 INFO L225 Difference]: With dead ends: 90 [2023-02-18 05:21:25,848 INFO L226 Difference]: Without dead ends: 90 [2023-02-18 05:21:25,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-18 05:21:25,849 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 52 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:25,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 58 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 05:21:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-18 05:21:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2023-02-18 05:21:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.490566037735849) internal successors, (79), 66 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2023-02-18 05:21:25,853 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 11 [2023-02-18 05:21:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:25,853 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2023-02-18 05:21:25,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2023-02-18 05:21:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-18 05:21:25,854 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:25,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:21:25,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 05:21:25,854 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:25,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:25,855 INFO L85 PathProgramCache]: Analyzing trace with hash 683852015, now seen corresponding path program 1 times [2023-02-18 05:21:25,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:25,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445819413] [2023-02-18 05:21:25,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:25,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:25,960 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-18 05:21:25,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:25,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445819413] [2023-02-18 05:21:25,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445819413] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:21:25,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:21:25,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 05:21:25,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164929605] [2023-02-18 05:21:25,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:21:25,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 05:21:25,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:25,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 05:21:25,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 05:21:25,962 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:25,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:25,990 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2023-02-18 05:21:25,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 05:21:25,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-18 05:21:25,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:25,991 INFO L225 Difference]: With dead ends: 66 [2023-02-18 05:21:25,991 INFO L226 Difference]: Without dead ends: 66 [2023-02-18 05:21:25,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 05:21:25,991 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:25,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 45 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 05:21:25,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-18 05:21:25,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-02-18 05:21:25,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.471698113207547) internal successors, (78), 65 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2023-02-18 05:21:25,995 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 13 [2023-02-18 05:21:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:25,995 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2023-02-18 05:21:25,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2023-02-18 05:21:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 05:21:25,996 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:25,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:21:25,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 05:21:25,996 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:25,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:25,997 INFO L85 PathProgramCache]: Analyzing trace with hash -833158411, now seen corresponding path program 1 times [2023-02-18 05:21:25,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:25,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126679130] [2023-02-18 05:21:25,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:26,142 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-18 05:21:26,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:26,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126679130] [2023-02-18 05:21:26,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126679130] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:21:26,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:21:26,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 05:21:26,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52171014] [2023-02-18 05:21:26,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:21:26,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 05:21:26,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:26,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 05:21:26,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 05:21:26,145 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:26,216 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2023-02-18 05:21:26,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 05:21:26,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2023-02-18 05:21:26,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:26,217 INFO L225 Difference]: With dead ends: 73 [2023-02-18 05:21:26,217 INFO L226 Difference]: Without dead ends: 73 [2023-02-18 05:21:26,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-02-18 05:21:26,218 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 58 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:26,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 84 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 05:21:26,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-18 05:21:26,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2023-02-18 05:21:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.4375) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2023-02-18 05:21:26,221 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 15 [2023-02-18 05:21:26,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:26,221 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2023-02-18 05:21:26,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2023-02-18 05:21:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 05:21:26,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:26,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:21:26,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 05:21:26,222 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:26,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:26,223 INFO L85 PathProgramCache]: Analyzing trace with hash -833147426, now seen corresponding path program 1 times [2023-02-18 05:21:26,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:26,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094693640] [2023-02-18 05:21:26,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:26,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:26,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-18 05:21:26,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:26,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094693640] [2023-02-18 05:21:26,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094693640] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:21:26,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:21:26,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 05:21:26,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920820212] [2023-02-18 05:21:26,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:21:26,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 05:21:26,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:26,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 05:21:26,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 05:21:26,256 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:26,298 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-02-18 05:21:26,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 05:21:26,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2023-02-18 05:21:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:26,299 INFO L225 Difference]: With dead ends: 77 [2023-02-18 05:21:26,299 INFO L226 Difference]: Without dead ends: 77 [2023-02-18 05:21:26,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-18 05:21:26,300 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 44 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:26,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 60 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 05:21:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-18 05:21:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2023-02-18 05:21:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 69 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:26,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2023-02-18 05:21:26,303 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 15 [2023-02-18 05:21:26,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:26,303 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2023-02-18 05:21:26,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2023-02-18 05:21:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 05:21:26,304 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:26,304 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:21:26,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-18 05:21:26,304 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:26,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:26,304 INFO L85 PathProgramCache]: Analyzing trace with hash 321145941, now seen corresponding path program 1 times [2023-02-18 05:21:26,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:26,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077367084] [2023-02-18 05:21:26,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:26,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:21:26,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:26,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077367084] [2023-02-18 05:21:26,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077367084] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:21:26,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857813880] [2023-02-18 05:21:26,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:26,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:21:26,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:21:26,415 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-18 05:21:26,445 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-18 05:21:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:26,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 05:21:26,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:21:26,519 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-18 05:21:26,521 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-18 05:21:26,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:26,542 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-18 05:21:26,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:26,548 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-18 05:21:26,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:26,560 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-18 05:21:26,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:26,564 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-18 05:21:26,591 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:26,592 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 15 treesize of output 7 [2023-02-18 05:21:26,598 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:26,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:26,599 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 15 treesize of output 10 [2023-02-18 05:21:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:21:26,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:21:26,753 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 10 treesize of output 8 [2023-02-18 05:21:26,759 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 14 treesize of output 12 [2023-02-18 05:21:26,767 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 10 treesize of output 8 [2023-02-18 05:21:26,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:21:26,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857813880] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:21:26,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:21:26,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2023-02-18 05:21:26,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169531022] [2023-02-18 05:21:26,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:21:26,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 05:21:26,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:26,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 05:21:26,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-18 05:21:26,783 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:26,972 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2023-02-18 05:21:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 05:21:26,973 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 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-18 05:21:26,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:26,974 INFO L225 Difference]: With dead ends: 85 [2023-02-18 05:21:26,974 INFO L226 Difference]: Without dead ends: 85 [2023-02-18 05:21:26,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2023-02-18 05:21:26,975 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 107 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:26,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 203 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 05:21:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-18 05:21:26,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2023-02-18 05:21:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 80 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2023-02-18 05:21:26,977 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 18 [2023-02-18 05:21:26,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:26,978 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2023-02-18 05:21:26,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:26,978 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2023-02-18 05:21:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 05:21:26,978 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:26,978 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-18 05:21:26,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 05:21:27,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:21:27,179 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:27,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:27,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1365588675, now seen corresponding path program 1 times [2023-02-18 05:21:27,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:27,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351348945] [2023-02-18 05:21:27,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:27,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:27,260 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-18 05:21:27,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:27,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351348945] [2023-02-18 05:21:27,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351348945] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:21:27,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623204720] [2023-02-18 05:21:27,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:27,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:21:27,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:21:27,263 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-18 05:21:27,292 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-18 05:21:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:27,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 05:21:27,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:21:27,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 05:21:27,355 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-18 05:21:27,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:21:27,360 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-18 05:21:27,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623204720] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:21:27,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:21:27,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-18 05:21:27,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998269059] [2023-02-18 05:21:27,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:21:27,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 05:21:27,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:27,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 05:21:27,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 05:21:27,362 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:27,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:27,411 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2023-02-18 05:21:27,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 05:21:27,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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-18 05:21:27,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:27,414 INFO L225 Difference]: With dead ends: 83 [2023-02-18 05:21:27,414 INFO L226 Difference]: Without dead ends: 72 [2023-02-18 05:21:27,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-18 05:21:27,416 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:27,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 88 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 05:21:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-18 05:21:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-02-18 05:21:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 71 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2023-02-18 05:21:27,422 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 19 [2023-02-18 05:21:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:27,422 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2023-02-18 05:21:27,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2023-02-18 05:21:27,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 05:21:27,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:27,424 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:21:27,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 05:21:27,629 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,SelfDestructingSolverStorable9 [2023-02-18 05:21:27,629 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:27,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash -190050214, now seen corresponding path program 1 times [2023-02-18 05:21:27,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:27,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381435804] [2023-02-18 05:21:27,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:27,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:27,695 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-18 05:21:27,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:27,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381435804] [2023-02-18 05:21:27,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381435804] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:21:27,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:21:27,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 05:21:27,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703623056] [2023-02-18 05:21:27,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:21:27,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 05:21:27,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:27,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 05:21:27,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 05:21:27,697 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-18 05:21:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:27,739 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2023-02-18 05:21:27,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 05:21:27,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-18 05:21:27,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:27,740 INFO L225 Difference]: With dead ends: 81 [2023-02-18 05:21:27,740 INFO L226 Difference]: Without dead ends: 81 [2023-02-18 05:21:27,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-18 05:21:27,741 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 74 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:27,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 51 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 05:21:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-18 05:21:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2023-02-18 05:21:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2023-02-18 05:21:27,749 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 19 [2023-02-18 05:21:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:27,750 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2023-02-18 05:21:27,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-18 05:21:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2023-02-18 05:21:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 05:21:27,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:27,753 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] [2023-02-18 05:21:27,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-18 05:21:27,753 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:27,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:27,754 INFO L85 PathProgramCache]: Analyzing trace with hash -36338646, now seen corresponding path program 1 times [2023-02-18 05:21:27,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:27,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387407552] [2023-02-18 05:21:27,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:27,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:27,967 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-18 05:21:27,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:27,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387407552] [2023-02-18 05:21:27,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387407552] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:21:27,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:21:27,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 05:21:27,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721315094] [2023-02-18 05:21:27,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:21:27,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 05:21:27,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:27,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 05:21:27,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-18 05:21:27,970 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:28,072 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2023-02-18 05:21:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 05:21:28,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2023-02-18 05:21:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:28,073 INFO L225 Difference]: With dead ends: 87 [2023-02-18 05:21:28,074 INFO L226 Difference]: Without dead ends: 87 [2023-02-18 05:21:28,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-02-18 05:21:28,074 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 53 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:28,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 158 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 05:21:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-18 05:21:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 68. [2023-02-18 05:21:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.375) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2023-02-18 05:21:28,076 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2023-02-18 05:21:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:28,076 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2023-02-18 05:21:28,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2023-02-18 05:21:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-18 05:21:28,077 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:28,077 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] [2023-02-18 05:21:28,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-18 05:21:28,078 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:28,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:28,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1126497925, now seen corresponding path program 1 times [2023-02-18 05:21:28,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:28,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303716762] [2023-02-18 05:21:28,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:28,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:28,252 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-18 05:21:28,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:28,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303716762] [2023-02-18 05:21:28,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303716762] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:21:28,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:21:28,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 05:21:28,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976148759] [2023-02-18 05:21:28,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:21:28,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 05:21:28,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:28,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 05:21:28,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-18 05:21:28,254 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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-18 05:21:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:28,373 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2023-02-18 05:21:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 05:21:28,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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-18 05:21:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:28,374 INFO L225 Difference]: With dead ends: 86 [2023-02-18 05:21:28,374 INFO L226 Difference]: Without dead ends: 86 [2023-02-18 05:21:28,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-02-18 05:21:28,375 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 47 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:28,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 131 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 05:21:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-18 05:21:28,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2023-02-18 05:21:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2023-02-18 05:21:28,377 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 25 [2023-02-18 05:21:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:28,377 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2023-02-18 05:21:28,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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-18 05:21:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2023-02-18 05:21:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 05:21:28,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:28,377 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] [2023-02-18 05:21:28,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-18 05:21:28,377 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:28,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:28,378 INFO L85 PathProgramCache]: Analyzing trace with hash -561697204, now seen corresponding path program 1 times [2023-02-18 05:21:28,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:28,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743740208] [2023-02-18 05:21:28,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:28,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:28,520 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-18 05:21:28,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:28,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743740208] [2023-02-18 05:21:28,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743740208] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:21:28,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:21:28,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 05:21:28,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79227944] [2023-02-18 05:21:28,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:21:28,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 05:21:28,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:28,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 05:21:28,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-18 05:21:28,522 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:28,619 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2023-02-18 05:21:28,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 05:21:28,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-02-18 05:21:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:28,620 INFO L225 Difference]: With dead ends: 69 [2023-02-18 05:21:28,620 INFO L226 Difference]: Without dead ends: 69 [2023-02-18 05:21:28,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-02-18 05:21:28,621 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:28,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 05:21:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-18 05:21:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-02-18 05:21:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 67 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2023-02-18 05:21:28,623 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 26 [2023-02-18 05:21:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:28,623 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2023-02-18 05:21:28,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2023-02-18 05:21:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 05:21:28,624 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:28,624 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:21:28,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-18 05:21:28,624 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:28,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:28,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846250, now seen corresponding path program 1 times [2023-02-18 05:21:28,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:28,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861778210] [2023-02-18 05:21:28,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:28,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:28,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:21:28,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:28,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861778210] [2023-02-18 05:21:28,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861778210] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:21:28,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199601185] [2023-02-18 05:21:28,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:28,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:21:28,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:21:28,765 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-18 05:21:28,767 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-18 05:21:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:28,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-18 05:21:28,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:21:28,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 05:21:28,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:28,842 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-18 05:21:28,850 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-18 05:21:28,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:28,862 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-18 05:21:28,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:28,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 71 [2023-02-18 05:21:28,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:28,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 55 treesize of output 68 [2023-02-18 05:21:28,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:28,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2023-02-18 05:21:28,922 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:28,922 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-18 05:21:28,925 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:28,925 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 19 treesize of output 13 [2023-02-18 05:21:28,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-18 05:21:28,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:21:28,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:21:29,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:29,037 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 49 treesize of output 53 [2023-02-18 05:21:29,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:29,078 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 38 treesize of output 30 [2023-02-18 05:21:29,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:29,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 66 [2023-02-18 05:21:29,085 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 20 treesize of output 18 [2023-02-18 05:21:29,088 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 9 treesize of output 7 [2023-02-18 05:21:29,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:29,097 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 19 treesize of output 20 [2023-02-18 05:21:29,099 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:29,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:29,101 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 17 treesize of output 9 [2023-02-18 05:21:29,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:29,104 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 18 treesize of output 19 [2023-02-18 05:21:29,105 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:29,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:29,107 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 16 treesize of output 1 [2023-02-18 05:21:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:21:29,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199601185] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:21:29,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:21:29,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 22 [2023-02-18 05:21:29,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633001952] [2023-02-18 05:21:29,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:21:29,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-18 05:21:29,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:29,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-18 05:21:29,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=440, Unknown=2, NotChecked=0, Total=506 [2023-02-18 05:21:29,159 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:29,598 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2023-02-18 05:21:29,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 05:21:29,599 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-18 05:21:29,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:29,599 INFO L225 Difference]: With dead ends: 95 [2023-02-18 05:21:29,599 INFO L226 Difference]: Without dead ends: 95 [2023-02-18 05:21:29,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=941, Unknown=2, NotChecked=0, Total=1190 [2023-02-18 05:21:29,600 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 207 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:29,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 176 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:21:29,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-18 05:21:29,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2023-02-18 05:21:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.360655737704918) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2023-02-18 05:21:29,602 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 26 [2023-02-18 05:21:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:29,602 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2023-02-18 05:21:29,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2023-02-18 05:21:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 05:21:29,602 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:29,602 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:21:29,611 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-18 05:21:29,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:21:29,810 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846251, now seen corresponding path program 1 times [2023-02-18 05:21:29,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:29,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311060936] [2023-02-18 05:21:29,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:29,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:21:30,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:30,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311060936] [2023-02-18 05:21:30,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311060936] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:21:30,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069171080] [2023-02-18 05:21:30,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:30,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:21:30,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:21:30,006 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-18 05:21:30,008 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-18 05:21:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:30,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-18 05:21:30,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:21:30,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 05:21:30,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 05:21:30,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:30,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2023-02-18 05:21:30,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:30,101 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-18 05:21:30,113 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-18 05:21:30,115 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-18 05:21:30,128 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:30,128 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 68 treesize of output 75 [2023-02-18 05:21:30,131 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-18 05:21:30,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:30,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 95 [2023-02-18 05:21:30,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:30,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 79 treesize of output 86 [2023-02-18 05:21:30,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:30,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2023-02-18 05:21:30,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:30,175 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-18 05:21:30,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:30,206 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 75 treesize of output 66 [2023-02-18 05:21:30,210 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:30,210 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 15 treesize of output 7 [2023-02-18 05:21:30,214 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:30,215 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 43 treesize of output 31 [2023-02-18 05:21:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:21:30,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:21:30,432 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:30,432 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 18 treesize of output 19 [2023-02-18 05:21:30,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:30,435 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 30 treesize of output 30 [2023-02-18 05:21:30,437 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 9 treesize of output 7 [2023-02-18 05:21:30,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:30,441 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 37 treesize of output 38 [2023-02-18 05:21:30,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:30,451 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 29 treesize of output 30 [2023-02-18 05:21:30,453 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:30,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:30,455 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 27 treesize of output 19 [2023-02-18 05:21:30,457 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:30,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:30,460 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 20 treesize of output 12 [2023-02-18 05:21:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:21:30,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069171080] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:21:30,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:21:30,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2023-02-18 05:21:30,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408115887] [2023-02-18 05:21:30,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:21:30,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-18 05:21:30,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:30,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-18 05:21:30,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=439, Unknown=1, NotChecked=0, Total=506 [2023-02-18 05:21:30,549 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:30,933 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2023-02-18 05:21:30,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 05:21:30,934 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-18 05:21:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:30,934 INFO L225 Difference]: With dead ends: 111 [2023-02-18 05:21:30,934 INFO L226 Difference]: Without dead ends: 111 [2023-02-18 05:21:30,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=255, Invalid=934, Unknown=1, NotChecked=0, Total=1190 [2023-02-18 05:21:30,935 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 156 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:30,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 164 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:21:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-18 05:21:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 85. [2023-02-18 05:21:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 84 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2023-02-18 05:21:30,937 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 26 [2023-02-18 05:21:30,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:30,937 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2023-02-18 05:21:30,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:30,937 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2023-02-18 05:21:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 05:21:30,937 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:30,937 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] [2023-02-18 05:21:30,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-18 05:21:31,142 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,SelfDestructingSolverStorable15 [2023-02-18 05:21:31,143 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:31,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:31,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1476440114, now seen corresponding path program 1 times [2023-02-18 05:21:31,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:31,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719951984] [2023-02-18 05:21:31,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:31,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:31,241 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-18 05:21:31,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:31,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719951984] [2023-02-18 05:21:31,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719951984] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:21:31,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704424891] [2023-02-18 05:21:31,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:31,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:21:31,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:21:31,243 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-18 05:21:31,292 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-18 05:21:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:31,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 05:21:31,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:21:31,359 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-18 05:21:31,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:31,362 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 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 05:21:31,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-18 05:21:31,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:31,378 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 27 treesize of output 42 [2023-02-18 05:21:31,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:31,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 70 [2023-02-18 05:21:31,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:31,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 54 treesize of output 67 [2023-02-18 05:21:31,399 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 05:21:31,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:31,419 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 44 treesize of output 41 [2023-02-18 05:21:31,423 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:31,423 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 12 treesize of output 8 [2023-02-18 05:21:31,425 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-18 05:21:31,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:21:31,471 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_28| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_28| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_28|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_677) |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_28|) 0)))) is different from false [2023-02-18 05:21:31,475 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:31,476 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 19 treesize of output 20 [2023-02-18 05:21:31,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:31,479 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 33 treesize of output 33 [2023-02-18 05:21:31,481 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 20 treesize of output 18 [2023-02-18 05:21:31,526 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-18 05:21:31,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704424891] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:21:31,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:21:31,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2023-02-18 05:21:31,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678868510] [2023-02-18 05:21:31,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:21:31,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 05:21:31,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:31,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 05:21:31,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=323, Unknown=1, NotChecked=36, Total=420 [2023-02-18 05:21:31,528 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:31,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:31,820 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2023-02-18 05:21:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 05:21:31,821 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 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 27 [2023-02-18 05:21:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:31,821 INFO L225 Difference]: With dead ends: 110 [2023-02-18 05:21:31,821 INFO L226 Difference]: Without dead ends: 110 [2023-02-18 05:21:31,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=829, Unknown=1, NotChecked=64, Total=1190 [2023-02-18 05:21:31,822 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 223 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:31,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 189 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 374 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2023-02-18 05:21:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-18 05:21:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 85. [2023-02-18 05:21:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.356164383561644) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2023-02-18 05:21:31,824 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 27 [2023-02-18 05:21:31,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:31,824 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2023-02-18 05:21:31,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2023-02-18 05:21:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 05:21:31,824 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:31,824 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] [2023-02-18 05:21:31,829 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-18 05:21:32,024 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,SelfDestructingSolverStorable16 [2023-02-18 05:21:32,025 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:32,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:32,025 INFO L85 PathProgramCache]: Analyzing trace with hash -328711838, now seen corresponding path program 1 times [2023-02-18 05:21:32,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:32,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674012437] [2023-02-18 05:21:32,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:32,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:32,214 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-18 05:21:32,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:32,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674012437] [2023-02-18 05:21:32,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674012437] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:21:32,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:21:32,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 05:21:32,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484388689] [2023-02-18 05:21:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:21:32,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 05:21:32,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:32,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 05:21:32,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-18 05:21:32,216 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:32,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:32,371 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2023-02-18 05:21:32,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 05:21:32,372 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-02-18 05:21:32,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:32,372 INFO L225 Difference]: With dead ends: 98 [2023-02-18 05:21:32,372 INFO L226 Difference]: Without dead ends: 98 [2023-02-18 05:21:32,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2023-02-18 05:21:32,373 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:32,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 103 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 05:21:32,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-18 05:21:32,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2023-02-18 05:21:32,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 84 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2023-02-18 05:21:32,375 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 29 [2023-02-18 05:21:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:32,375 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2023-02-18 05:21:32,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2023-02-18 05:21:32,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-18 05:21:32,376 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:32,376 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 05:21:32,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-18 05:21:32,376 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:32,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:32,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1935506277, now seen corresponding path program 1 times [2023-02-18 05:21:32,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:32,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271137] [2023-02-18 05:21:32,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:32,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:21:32,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:32,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271137] [2023-02-18 05:21:32,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271137] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:21:32,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43241636] [2023-02-18 05:21:32,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:32,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:21:32,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:21:32,702 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-18 05:21:32,704 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-18 05:21:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:32,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-18 05:21:32,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:21:32,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 05:21:32,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:32,785 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-18 05:21:32,790 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-18 05:21:32,798 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 33 treesize of output 35 [2023-02-18 05:21:32,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:32,809 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 44 treesize of output 82 [2023-02-18 05:21:32,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:32,821 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 54 treesize of output 45 [2023-02-18 05:21:32,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:32,879 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:32,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:32,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 65 [2023-02-18 05:21:32,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:32,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 72 [2023-02-18 05:21:32,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-18 05:21:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:21:32,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:21:33,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:33,206 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 237 treesize of output 301 [2023-02-18 05:21:33,289 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 8 0)) (.cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int) (v_prenex_8 Int)) (or (not (<= v_prenex_8 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_8)) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_7) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_7) v_prenex_8))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_7) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) v_prenex_7))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))) (or (= .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_8 Int) (v_prenex_6 (Array Int Int))) (or (not (<= v_prenex_8 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_8)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_7) v_prenex_8))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_7) (= .cse1 v_prenex_7)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse2 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))) (or (= .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_prenex_7 Int) (v_prenex_8 Int) (v_prenex_6 (Array Int Int))) (or (not (<= v_prenex_8 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_8)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_7) v_prenex_8))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_7) (= .cse2 v_prenex_7)))))))) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse3 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))) (or (= .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_8 Int) (v_prenex_6 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_7) (not (<= v_prenex_8 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_8)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_7) v_prenex_8))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_7) (= .cse3 v_prenex_7)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int) (v_prenex_8 Int)) (or (not (<= v_prenex_8 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_8)) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_7) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_7) v_prenex_8))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_7) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) v_prenex_7))))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (forall ((v_ArrVal_814 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~list~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse4 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))) (or (forall ((v_prenex_7 Int) (v_prenex_8 Int) (v_prenex_6 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_7) (not (<= v_prenex_8 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_8)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_7) v_prenex_8))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_7))) (= .cse4 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= .cse4 |c_ULTIMATE.start_main_~list~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (forall ((v_ArrVal_814 (Array Int Int))) (let ((.cse6 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (let ((.cse5 (select .cse6 |v_ULTIMATE.start_main_~list~0#1.offset_32|))) (or (not (= .cse5 (select .cse6 .cse7))) (= .cse5 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse8 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))) (or (= .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_8 Int) (v_prenex_6 (Array Int Int))) (or (not (<= v_prenex_8 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_8)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_7) v_prenex_8))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_7) (= .cse8 v_prenex_7)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse10 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (let ((.cse9 (select .cse10 |v_ULTIMATE.start_main_~list~0#1.offset_32|))) (or (not (= .cse9 (select .cse10 .cse7))) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))))))) (or (forall ((v_prenex_7 Int) (v_prenex_8 Int) (v_prenex_6 (Array Int Int))) (or (not (<= v_prenex_8 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_8)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_7) v_prenex_8))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_7))) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~list~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~list~0#1.base|))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse11 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))) (or (= .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_prenex_8 Int)) (or (not (<= v_prenex_8 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_8)) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_7) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_7) v_prenex_8))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_7) (= .cse11 v_prenex_7)))))))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))))) is different from false [2023-02-18 05:21:33,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:33,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 70 [2023-02-18 05:21:33,364 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 136 treesize of output 126 [2023-02-18 05:21:33,370 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 75 treesize of output 69 [2023-02-18 05:21:33,373 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:33,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:33,377 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 111 treesize of output 125 [2023-02-18 05:21:33,380 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:33,382 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 20 treesize of output 18 [2023-02-18 05:21:34,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,144 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 23 treesize of output 24 [2023-02-18 05:21:34,146 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-02-18 05:21:34,151 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:34,154 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 12 treesize of output 1 [2023-02-18 05:21:34,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,159 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 48 treesize of output 40 [2023-02-18 05:21:34,163 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,165 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 34 treesize of output 28 [2023-02-18 05:21:34,173 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:34,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,177 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2023-02-18 05:21:34,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,184 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 71 treesize of output 55 [2023-02-18 05:21:34,187 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,189 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 46 treesize of output 38 [2023-02-18 05:21:34,192 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:34,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,195 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 55 [2023-02-18 05:21:34,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 55 [2023-02-18 05:21:34,210 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,212 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 46 treesize of output 38 [2023-02-18 05:21:34,215 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:34,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,218 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 55 [2023-02-18 05:21:34,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 55 [2023-02-18 05:21:34,237 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,240 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 46 treesize of output 38 [2023-02-18 05:21:34,242 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:34,245 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,246 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 55 [2023-02-18 05:21:34,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 55 [2023-02-18 05:21:34,259 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,261 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 46 treesize of output 38 [2023-02-18 05:21:34,264 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:34,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,267 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 51 [2023-02-18 05:21:34,279 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,279 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 71 treesize of output 55 [2023-02-18 05:21:34,282 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,284 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 46 treesize of output 38 [2023-02-18 05:21:34,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:34,290 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,290 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 51 [2023-02-18 05:21:34,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2023-02-18 05:21:34,302 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,304 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 34 treesize of output 28 [2023-02-18 05:21:34,307 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:34,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,311 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2023-02-18 05:21:34,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,318 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 70 treesize of output 54 [2023-02-18 05:21:34,321 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,323 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 45 treesize of output 37 [2023-02-18 05:21:34,326 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:34,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,331 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 23 treesize of output 24 [2023-02-18 05:21:34,334 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-02-18 05:21:34,339 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:34,343 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 12 treesize of output 1 [2023-02-18 05:21:34,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2023-02-18 05:21:34,351 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,354 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 34 treesize of output 28 [2023-02-18 05:21:34,357 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:34,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,360 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2023-02-18 05:21:34,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:34,367 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 70 treesize of output 54 [2023-02-18 05:21:34,370 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,372 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 45 treesize of output 37 [2023-02-18 05:21:34,375 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:34,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:21:34,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43241636] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:21:34,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:21:34,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 37 [2023-02-18 05:21:34,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008549688] [2023-02-18 05:21:34,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:21:34,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-18 05:21:34,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:21:34,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-18 05:21:34,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1173, Unknown=1, NotChecked=70, Total=1406 [2023-02-18 05:21:34,462 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:21:35,624 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2023-02-18 05:21:35,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-18 05:21:35,624 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 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 31 [2023-02-18 05:21:35,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:21:35,624 INFO L225 Difference]: With dead ends: 96 [2023-02-18 05:21:35,625 INFO L226 Difference]: Without dead ends: 96 [2023-02-18 05:21:35,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=637, Invalid=2672, Unknown=1, NotChecked=112, Total=3422 [2023-02-18 05:21:35,626 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 215 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 05:21:35,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 211 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 562 Invalid, 0 Unknown, 55 Unchecked, 0.5s Time] [2023-02-18 05:21:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-18 05:21:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2023-02-18 05:21:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-02-18 05:21:35,628 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 31 [2023-02-18 05:21:35,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:21:35,628 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-02-18 05:21:35,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:21:35,628 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-02-18 05:21:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-18 05:21:35,629 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:21:35,629 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2023-02-18 05:21:35,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 05:21:35,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:21:35,834 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-18 05:21:35,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:21:35,835 INFO L85 PathProgramCache]: Analyzing trace with hash 678559033, now seen corresponding path program 1 times [2023-02-18 05:21:35,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:21:35,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52352803] [2023-02-18 05:21:35,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:35,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:21:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:21:36,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:21:36,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52352803] [2023-02-18 05:21:36,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52352803] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:21:36,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747529438] [2023-02-18 05:21:36,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:21:36,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:21:36,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:21:36,256 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:21:36,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 05:21:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:21:36,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-18 05:21:36,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:21:36,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 05:21:36,355 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 15 treesize of output 11 [2023-02-18 05:21:36,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 05:21:36,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:36,366 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-18 05:21:36,381 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 46 treesize of output 45 [2023-02-18 05:21:36,383 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 46 treesize of output 45 [2023-02-18 05:21:36,400 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:36,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 162 [2023-02-18 05:21:36,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:36,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 143 [2023-02-18 05:21:36,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:36,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:36,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 355 treesize of output 259 [2023-02-18 05:21:36,459 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:21:36,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:36,460 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:36,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 399 treesize of output 409 [2023-02-18 05:21:39,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:21:39,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:21:39,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 95 select indices, 95 select index equivalence classes, 2 disjoint index pairs (out of 4465 index pairs), introduced 118 new quantified variables, introduced 4465 case distinctions, treesize of input 2945 treesize of output 56822