./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 eb692b52 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-?-eb692b5 [2022-07-20 05:41:26,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:41:26,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:41:26,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:41:26,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:41:26,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:41:26,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:41:27,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:41:27,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:41:27,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:41:27,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:41:27,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:41:27,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:41:27,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:41:27,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:41:27,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:41:27,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:41:27,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:41:27,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:41:27,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:41:27,021 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:41:27,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:41:27,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:41:27,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:41:27,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:41:27,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:41:27,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:41:27,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:41:27,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:41:27,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:41:27,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:41:27,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:41:27,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:41:27,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:41:27,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:41:27,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:41:27,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:41:27,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:41:27,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:41:27,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:41:27,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:41:27,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:41:27,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:41:27,074 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:41:27,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:41:27,075 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:41:27,075 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:41:27,076 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:41:27,076 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:41:27,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:41:27,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:41:27,077 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:41:27,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:41:27,078 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:41:27,078 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:41:27,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:41:27,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:41:27,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:41:27,079 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:41:27,079 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:41:27,079 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:41:27,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:41:27,080 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:41:27,081 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:41:27,081 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:41:27,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:41:27,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:41:27,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:41:27,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:41:27,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:41:27,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:41:27,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:41:27,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:41:27,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-07-20 05:41:27,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:41:27,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:41:27,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:41:27,337 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:41:27,338 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:41:27,340 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 [2022-07-20 05:41:27,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/288434e19/30f034cc8b8a42da824b72d33eb2326e/FLAG1bf387259 [2022-07-20 05:41:27,792 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:41:27,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2022-07-20 05:41:27,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/288434e19/30f034cc8b8a42da824b72d33eb2326e/FLAG1bf387259 [2022-07-20 05:41:28,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/288434e19/30f034cc8b8a42da824b72d33eb2326e [2022-07-20 05:41:28,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:41:28,163 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:41:28,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:41:28,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:41:28,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:41:28,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:41:28" (1/1) ... [2022-07-20 05:41:28,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6961ad69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:28, skipping insertion in model container [2022-07-20 05:41:28,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:41:28" (1/1) ... [2022-07-20 05:41:28,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:41:28,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:41:28,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:41:28,494 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:41:28,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:41:28,566 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:41:28,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:28 WrapperNode [2022-07-20 05:41:28,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:41:28,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:41:28,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:41:28,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:41:28,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:28" (1/1) ... [2022-07-20 05:41:28,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:28" (1/1) ... [2022-07-20 05:41:28,604 INFO L137 Inliner]: procedures = 123, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2022-07-20 05:41:28,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:41:28,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:41:28,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:41:28,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:41:28,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:28" (1/1) ... [2022-07-20 05:41:28,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:28" (1/1) ... [2022-07-20 05:41:28,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:28" (1/1) ... [2022-07-20 05:41:28,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:28" (1/1) ... [2022-07-20 05:41:28,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:28" (1/1) ... [2022-07-20 05:41:28,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:28" (1/1) ... [2022-07-20 05:41:28,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:28" (1/1) ... [2022-07-20 05:41:28,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:41:28,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:41:28,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:41:28,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:41:28,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:28" (1/1) ... [2022-07-20 05:41:28,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:41:28,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:41:28,667 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) [2022-07-20 05:41:28,669 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 [2022-07-20 05:41:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:41:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:41:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:41:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:41:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:41:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 05:41:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:41:28,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:41:28,764 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:41:28,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:41:29,000 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:41:29,006 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:41:29,006 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-20 05:41:29,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:41:29 BoogieIcfgContainer [2022-07-20 05:41:29,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:41:29,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:41:29,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:41:29,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:41:29,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:41:28" (1/3) ... [2022-07-20 05:41:29,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7c97c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:41:29, skipping insertion in model container [2022-07-20 05:41:29,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:28" (2/3) ... [2022-07-20 05:41:29,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7c97c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:41:29, skipping insertion in model container [2022-07-20 05:41:29,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:41:29" (3/3) ... [2022-07-20 05:41:29,028 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2022-07-20 05:41:29,039 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:41:29,040 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-20 05:41:29,072 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:41:29,078 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2cbcfc17, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1752e4ff [2022-07-20 05:41:29,078 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-20 05:41:29,081 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) [2022-07-20 05:41:29,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:41:29,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:29,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:41:29,087 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)] === [2022-07-20 05:41:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:29,092 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 05:41:29,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:29,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579658611] [2022-07-20 05:41:29,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:29,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:29,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:29,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579658611] [2022-07-20 05:41:29,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579658611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:41:29,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:41:29,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:41:29,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736684944] [2022-07-20 05:41:29,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:41:29,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:41:29,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:29,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:41:29,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:41:29,277 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) [2022-07-20 05:41:29,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:29,347 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-07-20 05:41:29,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:41:29,350 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 [2022-07-20 05:41:29,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:29,355 INFO L225 Difference]: With dead ends: 63 [2022-07-20 05:41:29,355 INFO L226 Difference]: Without dead ends: 59 [2022-07-20 05:41:29,357 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 [2022-07-20 05:41:29,360 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 [2022-07-20 05:41:29,360 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] [2022-07-20 05:41:29,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-20 05:41:29,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-07-20 05:41:29,383 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) [2022-07-20 05:41:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-07-20 05:41:29,386 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 3 [2022-07-20 05:41:29,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:29,386 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-07-20 05:41:29,386 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) [2022-07-20 05:41:29,386 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-07-20 05:41:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:41:29,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:29,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:41:29,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:41:29,387 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)] === [2022-07-20 05:41:29,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:29,388 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 05:41:29,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:29,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965462742] [2022-07-20 05:41:29,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:29,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:29,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:29,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965462742] [2022-07-20 05:41:29,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965462742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:41:29,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:41:29,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:41:29,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29084501] [2022-07-20 05:41:29,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:41:29,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:41:29,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:29,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:41:29,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:41:29,428 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) [2022-07-20 05:41:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:29,474 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-07-20 05:41:29,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:41:29,475 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 [2022-07-20 05:41:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:29,476 INFO L225 Difference]: With dead ends: 55 [2022-07-20 05:41:29,476 INFO L226 Difference]: Without dead ends: 55 [2022-07-20 05:41:29,476 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 [2022-07-20 05:41:29,478 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 [2022-07-20 05:41:29,478 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] [2022-07-20 05:41:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-20 05:41:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2022-07-20 05:41:29,482 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) [2022-07-20 05:41:29,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-07-20 05:41:29,483 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 3 [2022-07-20 05:41:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:29,484 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-07-20 05:41:29,484 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) [2022-07-20 05:41:29,484 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-07-20 05:41:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:41:29,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:29,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:41:29,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:41:29,485 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)] === [2022-07-20 05:41:29,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:29,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897518, now seen corresponding path program 1 times [2022-07-20 05:41:29,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:29,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933121090] [2022-07-20 05:41:29,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:29,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:29,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:29,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933121090] [2022-07-20 05:41:29,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933121090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:41:29,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:41:29,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:41:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915366877] [2022-07-20 05:41:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:41:29,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:41:29,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:29,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:41:29,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:41:29,543 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) [2022-07-20 05:41:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:29,621 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-07-20 05:41:29,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:41:29,621 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 [2022-07-20 05:41:29,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:29,622 INFO L225 Difference]: With dead ends: 58 [2022-07-20 05:41:29,622 INFO L226 Difference]: Without dead ends: 58 [2022-07-20 05:41:29,623 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 [2022-07-20 05:41:29,624 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 47 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:29,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 31 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:41:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-20 05:41:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2022-07-20 05:41:29,629 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) [2022-07-20 05:41:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-20 05:41:29,630 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 10 [2022-07-20 05:41:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:29,630 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-20 05:41:29,630 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) [2022-07-20 05:41:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-20 05:41:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:41:29,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:29,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:41:29,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:41:29,631 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)] === [2022-07-20 05:41:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897519, now seen corresponding path program 1 times [2022-07-20 05:41:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:29,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393222055] [2022-07-20 05:41:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:29,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:29,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393222055] [2022-07-20 05:41:29,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393222055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:41:29,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:41:29,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:41:29,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951395170] [2022-07-20 05:41:29,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:41:29,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:41:29,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:29,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:41:29,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:41:29,708 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) [2022-07-20 05:41:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:29,797 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2022-07-20 05:41:29,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:41:29,798 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 [2022-07-20 05:41:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:29,799 INFO L225 Difference]: With dead ends: 87 [2022-07-20 05:41:29,799 INFO L226 Difference]: Without dead ends: 87 [2022-07-20 05:41:29,800 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 [2022-07-20 05:41:29,801 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 47 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:29,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 53 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:41:29,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-20 05:41:29,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2022-07-20 05:41:29,806 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) [2022-07-20 05:41:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-07-20 05:41:29,807 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 10 [2022-07-20 05:41:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:29,808 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-07-20 05:41:29,808 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) [2022-07-20 05:41:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-07-20 05:41:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:41:29,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:29,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:41:29,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:41:29,809 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)] === [2022-07-20 05:41:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash 233083786, now seen corresponding path program 1 times [2022-07-20 05:41:29,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:29,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433884182] [2022-07-20 05:41:29,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:29,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:29,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:29,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433884182] [2022-07-20 05:41:29,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433884182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:41:29,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:41:29,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:41:29,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79014571] [2022-07-20 05:41:29,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:41:29,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:41:29,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:29,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:41:29,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:41:29,855 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) [2022-07-20 05:41:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:29,917 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2022-07-20 05:41:29,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:41:29,918 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 [2022-07-20 05:41:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:29,918 INFO L225 Difference]: With dead ends: 90 [2022-07-20 05:41:29,918 INFO L226 Difference]: Without dead ends: 90 [2022-07-20 05:41:29,919 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 [2022-07-20 05:41:29,920 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 50 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:29,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 58 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:41:29,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-20 05:41:29,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2022-07-20 05:41:29,924 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) [2022-07-20 05:41:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-07-20 05:41:29,925 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 11 [2022-07-20 05:41:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:29,926 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-07-20 05:41:29,926 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) [2022-07-20 05:41:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-07-20 05:41:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:41:29,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:29,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:41:29,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:41:29,927 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)] === [2022-07-20 05:41:29,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash 683852015, now seen corresponding path program 1 times [2022-07-20 05:41:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:29,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999593656] [2022-07-20 05:41:29,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:29,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:30,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:30,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999593656] [2022-07-20 05:41:30,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999593656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:41:30,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:41:30,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:41:30,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284141092] [2022-07-20 05:41:30,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:41:30,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:41:30,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:30,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:41:30,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:41:30,026 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) [2022-07-20 05:41:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:30,070 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-07-20 05:41:30,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:41:30,071 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 [2022-07-20 05:41:30,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:30,071 INFO L225 Difference]: With dead ends: 66 [2022-07-20 05:41:30,071 INFO L226 Difference]: Without dead ends: 66 [2022-07-20 05:41:30,072 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 [2022-07-20 05:41:30,074 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 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 [2022-07-20 05:41:30,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 45 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:41:30,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-20 05:41:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-07-20 05:41:30,088 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) [2022-07-20 05:41:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-07-20 05:41:30,089 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 13 [2022-07-20 05:41:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:30,089 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-07-20 05:41:30,089 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) [2022-07-20 05:41:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-07-20 05:41:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:41:30,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:30,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:41:30,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:41:30,092 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)] === [2022-07-20 05:41:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash -833158411, now seen corresponding path program 1 times [2022-07-20 05:41:30,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:30,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475746911] [2022-07-20 05:41:30,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:30,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:30,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:30,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475746911] [2022-07-20 05:41:30,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475746911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:41:30,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:41:30,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:41:30,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512812943] [2022-07-20 05:41:30,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:41:30,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:41:30,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:30,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:41:30,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:41:30,217 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) [2022-07-20 05:41:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:30,343 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-07-20 05:41:30,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:41:30,344 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 [2022-07-20 05:41:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:30,346 INFO L225 Difference]: With dead ends: 73 [2022-07-20 05:41:30,346 INFO L226 Difference]: Without dead ends: 73 [2022-07-20 05:41:30,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:41:30,348 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 53 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:30,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 84 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:41:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-20 05:41:30,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2022-07-20 05:41:30,373 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) [2022-07-20 05:41:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-07-20 05:41:30,375 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 15 [2022-07-20 05:41:30,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:30,375 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-07-20 05:41:30,376 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) [2022-07-20 05:41:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-07-20 05:41:30,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:41:30,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:30,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:41:30,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 05:41:30,377 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)] === [2022-07-20 05:41:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash -833147426, now seen corresponding path program 1 times [2022-07-20 05:41:30,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:30,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121148907] [2022-07-20 05:41:30,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:30,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:30,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:30,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121148907] [2022-07-20 05:41:30,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121148907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:41:30,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:41:30,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:41:30,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545460040] [2022-07-20 05:41:30,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:41:30,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:41:30,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:30,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:41:30,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:41:30,483 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) [2022-07-20 05:41:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:30,563 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-07-20 05:41:30,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:41:30,564 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 [2022-07-20 05:41:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:30,564 INFO L225 Difference]: With dead ends: 77 [2022-07-20 05:41:30,564 INFO L226 Difference]: Without dead ends: 77 [2022-07-20 05:41:30,565 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 [2022-07-20 05:41:30,565 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 41 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:30,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 60 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:41:30,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-20 05:41:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-07-20 05:41:30,568 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) [2022-07-20 05:41:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-07-20 05:41:30,569 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 15 [2022-07-20 05:41:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:30,569 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-07-20 05:41:30,570 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) [2022-07-20 05:41:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-07-20 05:41:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:41:30,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:30,571 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:41:30,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:41:30,571 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)] === [2022-07-20 05:41:30,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:30,572 INFO L85 PathProgramCache]: Analyzing trace with hash 321145941, now seen corresponding path program 1 times [2022-07-20 05:41:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:30,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986772877] [2022-07-20 05:41:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:30,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:30,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:30,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986772877] [2022-07-20 05:41:30,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986772877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:41:30,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031683295] [2022-07-20 05:41:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:30,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:41:30,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:41:30,668 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) [2022-07-20 05:41:30,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 05:41:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:30,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 05:41:30,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:41:30,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:30,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:30,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:41:30,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:30,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:41:30,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:30,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:41:30,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:30,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:41:30,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:30,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:30,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:30,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:30,951 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:30,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:30,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:41:36,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 18 [2022-07-20 05:41:36,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:36,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:36,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:36,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 18 [2022-07-20 05:41:36,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:41:36,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:36,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:36,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031683295] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:41:36,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:41:36,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 14 [2022-07-20 05:41:36,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388295924] [2022-07-20 05:41:36,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:41:36,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 05:41:36,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:36,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 05:41:36,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=142, Unknown=4, NotChecked=0, Total=182 [2022-07-20 05:41:36,582 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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) [2022-07-20 05:41:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:36,842 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2022-07-20 05:41:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:41:36,843 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 [2022-07-20 05:41:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:36,845 INFO L225 Difference]: With dead ends: 85 [2022-07-20 05:41:36,845 INFO L226 Difference]: Without dead ends: 85 [2022-07-20 05:41:36,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=104, Invalid=312, Unknown=4, NotChecked=0, Total=420 [2022-07-20 05:41:36,846 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 108 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:36,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 223 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 150 Invalid, 0 Unknown, 62 Unchecked, 0.1s Time] [2022-07-20 05:41:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-20 05:41:36,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-07-20 05:41:36,848 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) [2022-07-20 05:41:36,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2022-07-20 05:41:36,849 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 18 [2022-07-20 05:41:36,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:36,849 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2022-07-20 05:41:36,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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) [2022-07-20 05:41:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2022-07-20 05:41:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 05:41:36,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:36,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:41:36,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 05:41:37,071 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 [2022-07-20 05:41:37,072 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)] === [2022-07-20 05:41:37,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:37,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1365588675, now seen corresponding path program 1 times [2022-07-20 05:41:37,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:37,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634066302] [2022-07-20 05:41:37,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:37,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:37,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:37,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634066302] [2022-07-20 05:41:37,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634066302] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:41:37,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628017793] [2022-07-20 05:41:37,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:37,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:41:37,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:41:37,142 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) [2022-07-20 05:41:37,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 05:41:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:37,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:41:37,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:41:37,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:37,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:41:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:37,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628017793] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:41:37,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:41:37,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-20 05:41:37,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418455101] [2022-07-20 05:41:37,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:41:37,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:41:37,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:37,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:41:37,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:41:37,303 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) [2022-07-20 05:41:37,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:37,377 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-07-20 05:41:37,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:41:37,378 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 [2022-07-20 05:41:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:37,380 INFO L225 Difference]: With dead ends: 83 [2022-07-20 05:41:37,380 INFO L226 Difference]: Without dead ends: 72 [2022-07-20 05:41:37,380 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 [2022-07-20 05:41:37,381 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:37,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 109 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-20 05:41:37,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-20 05:41:37,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-20 05:41:37,384 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) [2022-07-20 05:41:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2022-07-20 05:41:37,387 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 19 [2022-07-20 05:41:37,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:37,387 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2022-07-20 05:41:37,387 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) [2022-07-20 05:41:37,387 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-07-20 05:41:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 05:41:37,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:37,390 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:41:37,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:41:37,614 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 [2022-07-20 05:41:37,614 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)] === [2022-07-20 05:41:37,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:37,615 INFO L85 PathProgramCache]: Analyzing trace with hash -190050214, now seen corresponding path program 1 times [2022-07-20 05:41:37,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:37,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645223948] [2022-07-20 05:41:37,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:37,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:37,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:37,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645223948] [2022-07-20 05:41:37,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645223948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:41:37,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:41:37,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:41:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256063872] [2022-07-20 05:41:37,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:41:37,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:41:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:37,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:41:37,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:41:37,679 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) [2022-07-20 05:41:37,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:37,753 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2022-07-20 05:41:37,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:41:37,753 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 [2022-07-20 05:41:37,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:37,754 INFO L225 Difference]: With dead ends: 81 [2022-07-20 05:41:37,754 INFO L226 Difference]: Without dead ends: 81 [2022-07-20 05:41:37,754 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 [2022-07-20 05:41:37,755 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:37,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 59 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:41:37,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-20 05:41:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2022-07-20 05:41:37,757 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) [2022-07-20 05:41:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-07-20 05:41:37,758 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 19 [2022-07-20 05:41:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:37,758 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-07-20 05:41:37,758 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) [2022-07-20 05:41:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-07-20 05:41:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:41:37,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:37,759 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] [2022-07-20 05:41:37,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 05:41:37,760 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)] === [2022-07-20 05:41:37,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:37,760 INFO L85 PathProgramCache]: Analyzing trace with hash -36338646, now seen corresponding path program 1 times [2022-07-20 05:41:37,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:37,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993796056] [2022-07-20 05:41:37,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:37,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:37,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:37,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993796056] [2022-07-20 05:41:37,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993796056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:41:37,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:41:37,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:41:37,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200254836] [2022-07-20 05:41:37,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:41:37,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:41:37,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:37,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:41:37,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:41:37,855 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) [2022-07-20 05:41:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:38,000 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-07-20 05:41:38,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:41:38,000 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 [2022-07-20 05:41:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:38,001 INFO L225 Difference]: With dead ends: 87 [2022-07-20 05:41:38,001 INFO L226 Difference]: Without dead ends: 87 [2022-07-20 05:41:38,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:41:38,002 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 59 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:38,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 151 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:41:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-20 05:41:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 68. [2022-07-20 05:41:38,004 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) [2022-07-20 05:41:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-20 05:41:38,005 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2022-07-20 05:41:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:38,005 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-20 05:41:38,005 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) [2022-07-20 05:41:38,005 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-20 05:41:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 05:41:38,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:38,006 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] [2022-07-20 05:41:38,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 05:41:38,006 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)] === [2022-07-20 05:41:38,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1126497925, now seen corresponding path program 1 times [2022-07-20 05:41:38,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:38,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455967561] [2022-07-20 05:41:38,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:38,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:38,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:38,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455967561] [2022-07-20 05:41:38,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455967561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:41:38,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:41:38,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:41:38,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587625723] [2022-07-20 05:41:38,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:41:38,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:41:38,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:38,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:41:38,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:41:38,111 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) [2022-07-20 05:41:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:38,281 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-07-20 05:41:38,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:41:38,282 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 [2022-07-20 05:41:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:38,282 INFO L225 Difference]: With dead ends: 86 [2022-07-20 05:41:38,283 INFO L226 Difference]: Without dead ends: 86 [2022-07-20 05:41:38,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:41:38,283 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 50 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:38,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 125 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:41:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-20 05:41:38,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2022-07-20 05:41:38,286 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) [2022-07-20 05:41:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-07-20 05:41:38,286 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 25 [2022-07-20 05:41:38,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:38,286 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-07-20 05:41:38,286 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) [2022-07-20 05:41:38,286 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-07-20 05:41:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 05:41:38,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:38,287 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] [2022-07-20 05:41:38,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 05:41:38,288 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)] === [2022-07-20 05:41:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash -561697204, now seen corresponding path program 1 times [2022-07-20 05:41:38,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:38,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532833530] [2022-07-20 05:41:38,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:38,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:38,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:38,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532833530] [2022-07-20 05:41:38,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532833530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:41:38,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:41:38,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:41:38,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139803138] [2022-07-20 05:41:38,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:41:38,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:41:38,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:38,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:41:38,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:41:38,403 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) [2022-07-20 05:41:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:38,533 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-07-20 05:41:38,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:41:38,534 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 [2022-07-20 05:41:38,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:38,534 INFO L225 Difference]: With dead ends: 69 [2022-07-20 05:41:38,534 INFO L226 Difference]: Without dead ends: 69 [2022-07-20 05:41:38,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:41:38,536 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:38,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 74 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:41:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-20 05:41:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-07-20 05:41:38,538 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) [2022-07-20 05:41:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2022-07-20 05:41:38,539 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 26 [2022-07-20 05:41:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:38,540 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2022-07-20 05:41:38,541 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) [2022-07-20 05:41:38,541 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2022-07-20 05:41:38,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 05:41:38,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:38,543 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] [2022-07-20 05:41:38,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 05:41:38,544 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)] === [2022-07-20 05:41:38,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:38,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846250, now seen corresponding path program 1 times [2022-07-20 05:41:38,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:38,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491594598] [2022-07-20 05:41:38,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:38,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:38,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:38,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491594598] [2022-07-20 05:41:38,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491594598] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:41:38,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885083738] [2022-07-20 05:41:38,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:38,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:41:38,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:41:38,701 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) [2022-07-20 05:41:38,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 05:41:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:38,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-20 05:41:38,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:41:38,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:38,822 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:41:38,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:41:38,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:38,874 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:41:38,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 [2022-07-20 05:41:38,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:41:38,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-07-20 05:41:38,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:38,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:38,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 16 [2022-07-20 05:41:38,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:39,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:41:39,827 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:39,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 45 [2022-07-20 05:41:43,926 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:43,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 25 [2022-07-20 05:41:43,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2022-07-20 05:41:43,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:43,943 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:43,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 38 [2022-07-20 05:41:43,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:43,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:43,970 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:41:43,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 [2022-07-20 05:41:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:44,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885083738] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:41:44,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:41:44,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 23 [2022-07-20 05:41:44,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801341389] [2022-07-20 05:41:44,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:41:44,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 05:41:44,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:44,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 05:41:44,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=480, Unknown=4, NotChecked=0, Total=552 [2022-07-20 05:41:44,064 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 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) [2022-07-20 05:41:44,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:44,574 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-07-20 05:41:44,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:41:44,575 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 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 [2022-07-20 05:41:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:44,575 INFO L225 Difference]: With dead ends: 95 [2022-07-20 05:41:44,575 INFO L226 Difference]: Without dead ends: 95 [2022-07-20 05:41:44,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=235, Invalid=951, Unknown=4, NotChecked=0, Total=1190 [2022-07-20 05:41:44,576 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 212 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:44,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 154 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 402 Invalid, 0 Unknown, 102 Unchecked, 0.3s Time] [2022-07-20 05:41:44,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-20 05:41:44,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2022-07-20 05:41:44,578 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) [2022-07-20 05:41:44,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-07-20 05:41:44,579 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 26 [2022-07-20 05:41:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:44,579 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-07-20 05:41:44,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 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) [2022-07-20 05:41:44,579 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-07-20 05:41:44,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 05:41:44,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:44,580 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] [2022-07-20 05:41:44,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 05:41:44,791 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 [2022-07-20 05:41:44,792 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)] === [2022-07-20 05:41:44,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:44,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846251, now seen corresponding path program 1 times [2022-07-20 05:41:44,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:44,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926314488] [2022-07-20 05:41:44,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:44,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:44,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:44,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926314488] [2022-07-20 05:41:44,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926314488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:41:44,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246804840] [2022-07-20 05:41:44,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:44,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:41:44,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:41:44,954 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) [2022-07-20 05:41:44,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 05:41:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:45,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-20 05:41:45,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:41:45,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:45,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:45,097 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:41:45,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:41:45,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:45,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:45,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:45,175 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:41:45,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 05:41:45,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:41:45,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:41:45,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:45,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:41:45,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-07-20 05:41:45,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:45,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-20 05:41:45,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:45,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:45,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:41:46,499 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:46,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-07-20 05:41:46,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 36 [2022-07-20 05:41:46,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:46,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:46,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:46,516 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:46,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 21 [2022-07-20 05:41:46,531 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:46,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 48 [2022-07-20 05:41:46,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:46,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 40 [2022-07-20 05:41:46,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:46,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-07-20 05:41:46,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:46,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-07-20 05:41:46,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:46,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2022-07-20 05:41:46,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:46,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-07-20 05:41:52,796 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 25 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 05:41:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:52,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246804840] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:41:52,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:41:52,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2022-07-20 05:41:52,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115721058] [2022-07-20 05:41:52,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:41:52,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 05:41:52,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:52,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 05:41:52,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=478, Unknown=3, NotChecked=0, Total=552 [2022-07-20 05:41:52,896 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 24 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) [2022-07-20 05:41:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:53,309 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2022-07-20 05:41:53,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:41:53,310 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 24 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 [2022-07-20 05:41:53,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:53,310 INFO L225 Difference]: With dead ends: 100 [2022-07-20 05:41:53,310 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 05:41:53,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=134, Invalid=793, Unknown=3, NotChecked=0, Total=930 [2022-07-20 05:41:53,311 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 46 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:53,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 298 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 352 Invalid, 0 Unknown, 229 Unchecked, 0.2s Time] [2022-07-20 05:41:53,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 05:41:53,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2022-07-20 05:41:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 90 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:41:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2022-07-20 05:41:53,314 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 26 [2022-07-20 05:41:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:53,314 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2022-07-20 05:41:53,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 24 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) [2022-07-20 05:41:53,314 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2022-07-20 05:41:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:41:53,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:53,315 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] [2022-07-20 05:41:53,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-20 05:41:53,531 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 [2022-07-20 05:41:53,532 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:41:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash 94520065, now seen corresponding path program 1 times [2022-07-20 05:41:53,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:53,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85450025] [2022-07-20 05:41:53,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:53,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:53,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:53,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85450025] [2022-07-20 05:41:53,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85450025] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:41:53,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878186678] [2022-07-20 05:41:53,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:53,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:41:53,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:41:53,728 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) [2022-07-20 05:41:53,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 05:41:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:53,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 05:41:53,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:41:53,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:53,857 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:41:53,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:41:53,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:53,922 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:53,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 18 [2022-07-20 05:41:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:53,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:41:53,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878186678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:41:53,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 05:41:53,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2022-07-20 05:41:53,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605451989] [2022-07-20 05:41:53,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:41:53,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:41:53,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:41:53,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:41:53,953 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:41:54,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:54,166 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-07-20 05:41:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:41:54,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 05:41:54,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:54,168 INFO L225 Difference]: With dead ends: 100 [2022-07-20 05:41:54,168 INFO L226 Difference]: Without dead ends: 99 [2022-07-20 05:41:54,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2022-07-20 05:41:54,169 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:54,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 172 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:41:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-20 05:41:54,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2022-07-20 05:41:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 90 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:41:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2022-07-20 05:41:54,172 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 27 [2022-07-20 05:41:54,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:54,172 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2022-07-20 05:41:54,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:41:54,172 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2022-07-20 05:41:54,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:41:54,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:54,173 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] [2022-07-20 05:41:54,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-20 05:41:54,391 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 [2022-07-20 05:41:54,392 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:41:54,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:54,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1476440114, now seen corresponding path program 1 times [2022-07-20 05:41:54,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:54,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050498063] [2022-07-20 05:41:54,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:54,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:54,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:54,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050498063] [2022-07-20 05:41:54,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050498063] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:41:54,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669282759] [2022-07-20 05:41:54,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:54,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:41:54,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:41:54,493 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) [2022-07-20 05:41:54,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 05:41:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:54,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 05:41:54,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:41:54,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:54,617 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:41:54,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:41:54,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:54,675 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:41:54,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 [2022-07-20 05:41:54,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:41:54,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 25 [2022-07-20 05:41:54,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:54,742 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:54,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 15 [2022-07-20 05:41:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:54,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:41:55,436 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_28| Int) (v_ArrVal_768 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 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_768) |v_ULTIMATE.start_main_~list~0#1.offset_28|) 0)))) is different from false [2022-07-20 05:41:55,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:55,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 25 [2022-07-20 05:41:55,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2022-07-20 05:41:55,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:55,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:55,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 38 [2022-07-20 05:41:55,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:55,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:55,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669282759] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:41:55,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:41:55,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 22 [2022-07-20 05:41:55,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751717158] [2022-07-20 05:41:55,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:41:55,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 05:41:55,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:55,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 05:41:55,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=357, Unknown=2, NotChecked=38, Total=462 [2022-07-20 05:41:55,609 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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) [2022-07-20 05:41:55,997 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (forall ((v_ArrVal_766 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_28| Int) (v_ArrVal_768 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 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_768) |v_ULTIMATE.start_main_~list~0#1.offset_28|) 0)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0))) is different from false [2022-07-20 05:41:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:41:56,474 INFO L93 Difference]: Finished difference Result 184 states and 207 transitions. [2022-07-20 05:41:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 05:41:56,474 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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 [2022-07-20 05:41:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:41:56,475 INFO L225 Difference]: With dead ends: 184 [2022-07-20 05:41:56,475 INFO L226 Difference]: Without dead ends: 184 [2022-07-20 05:41:56,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=234, Invalid=1253, Unknown=3, NotChecked=150, Total=1640 [2022-07-20 05:41:56,476 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 106 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 424 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:41:56,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 454 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 566 Invalid, 0 Unknown, 424 Unchecked, 0.3s Time] [2022-07-20 05:41:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-20 05:41:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 131. [2022-07-20 05:41:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 119 states have (on average 1.2352941176470589) internal successors, (147), 130 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:41:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2022-07-20 05:41:56,479 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 27 [2022-07-20 05:41:56,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:41:56,480 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2022-07-20 05:41:56,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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) [2022-07-20 05:41:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2022-07-20 05:41:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:41:56,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:41:56,480 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:41:56,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-20 05:41:56,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-20 05:41:56,692 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:41:56,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:41:56,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1475025644, now seen corresponding path program 1 times [2022-07-20 05:41:56,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:41:56,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845916414] [2022-07-20 05:41:56,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:56,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:41:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:56,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:41:56,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845916414] [2022-07-20 05:41:56,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845916414] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:41:56,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880711515] [2022-07-20 05:41:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:41:56,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:41:56,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:41:56,886 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) [2022-07-20 05:41:56,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 05:41:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:41:56,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 05:41:56,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:41:56,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:57,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:57,047 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:41:57,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 18 [2022-07-20 05:41:57,063 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:41:57,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:41:57,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:57,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:57,138 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:41:57,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 05:41:57,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:41:57,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:41:57,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-07-20 05:41:57,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:41:57,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:57,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:57,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-20 05:41:57,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:57,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:41:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:57,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:41:58,444 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_863 Int) (v_ArrVal_862 Int) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_33| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_862) |v_ULTIMATE.start_main_~list~0#1.offset_33|))) (or (not (<= 0 .cse0)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_33|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_33| |c_ULTIMATE.start_main_~y~0#1.offset|)) (<= (+ 12 .cse0) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_863) |v_ULTIMATE.start_main_~list~0#1.offset_33|))))))) is different from false [2022-07-20 05:41:58,456 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:58,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 64 [2022-07-20 05:41:58,464 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:58,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 40 [2022-07-20 05:41:58,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 68 [2022-07-20 05:41:58,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 160 treesize of output 152 [2022-07-20 05:41:58,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:58,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 42 [2022-07-20 05:41:58,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:58,494 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:58,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 56 [2022-07-20 05:41:58,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:58,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 103 treesize of output 97 [2022-07-20 05:41:58,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:41:58,511 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:41:58,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 88 [2022-07-20 05:41:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:41:58,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880711515] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:41:58,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:41:58,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 27 [2022-07-20 05:41:58,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719223740] [2022-07-20 05:41:58,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:41:58,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 05:41:58,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:41:58,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 05:41:58,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=613, Unknown=2, NotChecked=50, Total=756 [2022-07-20 05:41:58,825 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:41:59,604 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (<= 13 (select |c_#length| |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_863 Int) (v_ArrVal_862 Int) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_33| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_862) |v_ULTIMATE.start_main_~list~0#1.offset_33|))) (or (not (<= 0 .cse0)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_33|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_33| |c_ULTIMATE.start_main_~y~0#1.offset|)) (<= (+ 12 .cse0) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_863) |v_ULTIMATE.start_main_~list~0#1.offset_33|))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (<= 13 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (= (+ |c_ULTIMATE.start_main_~list~0#1.offset| (* (- 1) |c_ULTIMATE.start_main_~y~0#1.offset|)) 0)) is different from false [2022-07-20 05:42:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:42:00,228 INFO L93 Difference]: Finished difference Result 201 states and 224 transitions. [2022-07-20 05:42:00,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 05:42:00,229 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 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 28 [2022-07-20 05:42:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:42:00,230 INFO L225 Difference]: With dead ends: 201 [2022-07-20 05:42:00,230 INFO L226 Difference]: Without dead ends: 201 [2022-07-20 05:42:00,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=276, Invalid=1451, Unknown=3, NotChecked=162, Total=1892 [2022-07-20 05:42:00,231 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 204 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 307 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:42:00,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 259 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 442 Invalid, 0 Unknown, 307 Unchecked, 0.3s Time] [2022-07-20 05:42:00,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-20 05:42:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 152. [2022-07-20 05:42:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 151 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:42:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2022-07-20 05:42:00,234 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 28 [2022-07-20 05:42:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:42:00,234 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2022-07-20 05:42:00,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:42:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2022-07-20 05:42:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 05:42:00,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:42:00,235 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] [2022-07-20 05:42:00,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 05:42:00,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:42:00,436 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:42:00,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:42:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash -328711838, now seen corresponding path program 1 times [2022-07-20 05:42:00,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:42:00,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936766271] [2022-07-20 05:42:00,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:42:00,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:42:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:42:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:42:00,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:42:00,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936766271] [2022-07-20 05:42:00,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936766271] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:42:00,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:42:00,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:42:00,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295557109] [2022-07-20 05:42:00,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:42:00,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:42:00,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:42:00,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:42:00,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:42:00,570 INFO L87 Difference]: Start difference. First operand 152 states and 175 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) [2022-07-20 05:42:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:42:00,769 INFO L93 Difference]: Finished difference Result 179 states and 202 transitions. [2022-07-20 05:42:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:42:00,769 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 [2022-07-20 05:42:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:42:00,770 INFO L225 Difference]: With dead ends: 179 [2022-07-20 05:42:00,770 INFO L226 Difference]: Without dead ends: 179 [2022-07-20 05:42:00,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-07-20 05:42:00,771 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 55 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:42:00,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 102 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:42:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-20 05:42:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 152. [2022-07-20 05:42:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 141 states have (on average 1.2340425531914894) internal successors, (174), 151 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:42:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2022-07-20 05:42:00,773 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 29 [2022-07-20 05:42:00,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:42:00,773 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2022-07-20 05:42:00,774 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) [2022-07-20 05:42:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2022-07-20 05:42:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 05:42:00,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:42:00,774 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] [2022-07-20 05:42:00,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 05:42:00,774 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:42:00,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:42:00,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1935506277, now seen corresponding path program 1 times [2022-07-20 05:42:00,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:42:00,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649336801] [2022-07-20 05:42:00,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:42:00,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:42:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:42:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:42:01,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:42:01,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649336801] [2022-07-20 05:42:01,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649336801] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:42:01,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931727840] [2022-07-20 05:42:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:42:01,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:42:01,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:42:01,077 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:42:01,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 05:42:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:42:01,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-20 05:42:01,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:42:01,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:01,202 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:42:01,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:42:01,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:01,224 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:42:01,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 [2022-07-20 05:42:01,249 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-20 05:42:01,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-07-20 05:42:01,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:42:01,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 30 [2022-07-20 05:42:01,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:01,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:42:01,454 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-20 05:42:01,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 41 [2022-07-20 05:42:01,554 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:42:01,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 05:42:01,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:42:01,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:42:20,219 INFO L356 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2022-07-20 05:42:20,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 206 treesize of output 231 [2022-07-20 05:42:20,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_37| Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_12| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_37| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_37|)) (and (forall ((v_ArrVal_998 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_main_~list~0#1.offset_37|))) (or (and (forall ((v_prenex_3 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) |v_ULTIMATE.start_main_~list~0#1.offset_37|) |c_ULTIMATE.start_main_~y~0#1.base|))) (not (= (select .cse0 8) .cse1))) (= .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))))) (forall ((v_ArrVal_998 (Array Int Int))) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) |v_ULTIMATE.start_main_~list~0#1.offset_37|)))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))) is different from false [2022-07-20 05:42:20,842 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:42:20,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:20,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 36 [2022-07-20 05:42:20,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:20,855 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:42:20,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 21 [2022-07-20 05:42:20,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:20,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:20,872 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:42:20,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 93 treesize of output 69 [2022-07-20 05:42:20,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:20,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2022-07-20 05:42:20,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:20,888 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:42:20,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 30 [2022-07-20 05:42:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:42:20,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931727840] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:42:20,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:42:20,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 37 [2022-07-20 05:42:20,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351015533] [2022-07-20 05:42:20,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:42:20,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 05:42:20,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:42:20,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 05:42:20,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1166, Unknown=9, NotChecked=70, Total=1406 [2022-07-20 05:42:20,974 INFO L87 Difference]: Start difference. First operand 152 states and 174 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) [2022-07-20 05:42:21,635 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_37| Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_12| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_37| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_37|)) (and (forall ((v_ArrVal_998 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_main_~list~0#1.offset_37|))) (or (and (forall ((v_prenex_3 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) |v_ULTIMATE.start_main_~list~0#1.offset_37|) |c_ULTIMATE.start_main_~y~0#1.base|))) (not (= (select .cse0 8) .cse1))) (= .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))))) (forall ((v_ArrVal_998 (Array Int Int))) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) |v_ULTIMATE.start_main_~list~0#1.offset_37|)))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))) (= (select |c_#valid| .cse2) 1) (= .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1))) is different from false [2022-07-20 05:42:22,362 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (not (= (select .cse0 8) .cse1)) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_37| Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_12| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_37| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_37|)) (and (forall ((v_ArrVal_998 (Array Int Int))) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))) (let ((.cse3 (select .cse2 |v_ULTIMATE.start_main_~list~0#1.offset_37|))) (or (and (forall ((v_prenex_3 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) |v_ULTIMATE.start_main_~list~0#1.offset_37|) |c_ULTIMATE.start_main_~y~0#1.base|))) (not (= (select .cse2 8) .cse3))) (= .cse3 |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))))) (forall ((v_ArrVal_998 (Array Int Int))) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) |v_ULTIMATE.start_main_~list~0#1.offset_37|)))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))) (= (select |c_#valid| .cse4) 1) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1)) (= .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= .cse4 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (= (select |c_#valid| .cse1) 1)))) is different from false [2022-07-20 05:42:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:42:22,662 INFO L93 Difference]: Finished difference Result 170 states and 190 transitions. [2022-07-20 05:42:22,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-20 05:42:22,663 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 [2022-07-20 05:42:22,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:42:22,663 INFO L225 Difference]: With dead ends: 170 [2022-07-20 05:42:22,664 INFO L226 Difference]: Without dead ends: 170 [2022-07-20 05:42:22,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=402, Invalid=2251, Unknown=11, NotChecked=306, Total=2970 [2022-07-20 05:42:22,665 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 87 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 404 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:42:22,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 326 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 459 Invalid, 0 Unknown, 404 Unchecked, 0.2s Time] [2022-07-20 05:42:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-20 05:42:22,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 146. [2022-07-20 05:42:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 145 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:42:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 168 transitions. [2022-07-20 05:42:22,668 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 168 transitions. Word has length 31 [2022-07-20 05:42:22,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:42:22,669 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 168 transitions. [2022-07-20 05:42:22,669 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) [2022-07-20 05:42:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 168 transitions. [2022-07-20 05:42:22,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 05:42:22,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:42:22,669 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] [2022-07-20 05:42:22,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 05:42:22,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-20 05:42:22,879 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:42:22,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:42:22,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1935506278, now seen corresponding path program 1 times [2022-07-20 05:42:22,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:42:22,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248113912] [2022-07-20 05:42:22,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:42:22,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:42:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:42:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:42:23,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:42:23,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248113912] [2022-07-20 05:42:23,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248113912] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:42:23,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315514607] [2022-07-20 05:42:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:42:23,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:42:23,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:42:23,026 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:42:23,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 05:42:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:42:23,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-20 05:42:23,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:42:23,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:23,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:23,195 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:42:23,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 18 [2022-07-20 05:42:23,211 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:42:23,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:42:23,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:23,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:23,279 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:42:23,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 44 [2022-07-20 05:42:23,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:42:23,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:42:23,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:42:23,342 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-20 05:42:23,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2022-07-20 05:42:23,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:42:23,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:23,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:42:23,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-07-20 05:42:23,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:23,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-20 05:42:23,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:23,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:42:23,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:42:25,796 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:42:25,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-07-20 05:42:25,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_15| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_41| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_15|) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_41| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_41|)) (and (forall ((v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1103 Int) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1102 Int) (v_ArrVal_1104 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1101) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_1104) |v_ULTIMATE.start_main_~list~0#1.offset_41|) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc8#1.base_15| v_ArrVal_1102) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_1103) |v_ULTIMATE.start_main_~list~0#1.offset_41|))))) (forall ((v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1104 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1101) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1104) |v_ULTIMATE.start_main_~list~0#1.offset_41|)))))) is different from false [2022-07-20 05:42:25,881 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:42:25,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-07-20 05:42:25,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 36 [2022-07-20 05:42:25,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:25,899 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:42:25,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 21 [2022-07-20 05:42:25,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:25,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:25,920 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:42:25,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 51 [2022-07-20 05:42:25,923 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:25,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-07-20 05:42:25,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:42:25,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2022-07-20 05:42:25,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:25,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-07-20 05:42:25,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:25,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 22 [2022-07-20 05:42:25,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:25,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 [2022-07-20 05:42:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:42:26,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315514607] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:42:26,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:42:26,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2022-07-20 05:42:26,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362496380] [2022-07-20 05:42:26,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:42:26,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 05:42:26,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:42:26,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 05:42:26,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=770, Unknown=3, NotChecked=56, Total=930 [2022-07-20 05:42:26,320 INFO L87 Difference]: Start difference. First operand 146 states and 168 transitions. Second operand has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:42:27,510 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (<= 13 (select |c_#length| .cse0)) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) 0) (= .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (<= 13 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_15| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_41| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_15|) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_41| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_41|)) (and (forall ((v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1103 Int) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1102 Int) (v_ArrVal_1104 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1101) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1104) |v_ULTIMATE.start_main_~list~0#1.offset_41|) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc8#1.base_15| v_ArrVal_1102) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1103) |v_ULTIMATE.start_main_~list~0#1.offset_41|))))) (forall ((v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1104 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1101) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1104) |v_ULTIMATE.start_main_~list~0#1.offset_41|)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1))) is different from false [2022-07-20 05:42:30,346 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_1103 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_41| Int) (v_ArrVal_1104 Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1104) |v_ULTIMATE.start_main_~list~0#1.offset_41|))) (and (<= 0 .cse0) (<= (+ .cse0 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1103) |v_ULTIMATE.start_main_~list~0#1.offset_41|)))))) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_41| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_41|)))) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) 0) (= .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (<= 8 (select |c_#length| .cse2)))) is different from false [2022-07-20 05:42:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:42:39,556 INFO L93 Difference]: Finished difference Result 330 states and 370 transitions. [2022-07-20 05:42:39,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-20 05:42:39,557 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 05:42:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:42:39,558 INFO L225 Difference]: With dead ends: 330 [2022-07-20 05:42:39,558 INFO L226 Difference]: Without dead ends: 330 [2022-07-20 05:42:39,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=558, Invalid=3231, Unknown=5, NotChecked=366, Total=4160 [2022-07-20 05:42:39,560 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 222 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 565 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:42:39,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 398 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 545 Invalid, 0 Unknown, 565 Unchecked, 0.4s Time] [2022-07-20 05:42:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-07-20 05:42:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 215. [2022-07-20 05:42:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 204 states have (on average 1.2205882352941178) internal successors, (249), 214 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:42:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 249 transitions. [2022-07-20 05:42:39,564 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 249 transitions. Word has length 31 [2022-07-20 05:42:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:42:39,565 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 249 transitions. [2022-07-20 05:42:39,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:42:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 249 transitions. [2022-07-20 05:42:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 05:42:39,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:42:39,572 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] [2022-07-20 05:42:39,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 05:42:39,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:42:39,773 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:42:39,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:42:39,773 INFO L85 PathProgramCache]: Analyzing trace with hash 678559033, now seen corresponding path program 1 times [2022-07-20 05:42:39,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:42:39,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669664587] [2022-07-20 05:42:39,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:42:39,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:42:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:42:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:42:40,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:42:40,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669664587] [2022-07-20 05:42:40,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669664587] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:42:40,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463165861] [2022-07-20 05:42:40,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:42:40,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:42:40,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:42:40,050 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:42:40,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 05:42:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:42:40,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-20 05:42:40,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:42:40,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:40,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:40,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:42:40,199 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:42:40,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:42:40,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-20 05:42:40,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-20 05:42:40,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:42:40,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 50 [2022-07-20 05:42:40,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-20 05:42:40,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:42:40,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:40,348 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-20 05:42:40,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 59 treesize of output 48 [2022-07-20 05:42:40,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:42:40,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-07-20 05:42:40,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:40,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:42:40,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:42:40,769 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:42:40,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 case distinctions, treesize of input 62 treesize of output 34 [2022-07-20 05:42:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:42:40,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:43:01,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:01,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:01,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:01,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:01,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:01,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:01,867 INFO L356 Elim1Store]: treesize reduction 214, result has 49.9 percent of original size [2022-07-20 05:43:01,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2181 treesize of output 1452 [2022-07-20 05:43:01,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:01,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:01,967 INFO L356 Elim1Store]: treesize reduction 239, result has 21.4 percent of original size [2022-07-20 05:43:01,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64336 treesize of output 15179 [2022-07-20 05:43:02,289 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-20 05:43:02,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 9775 treesize of output 9095 [2022-07-20 05:43:02,387 INFO L356 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2022-07-20 05:43:02,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9105 treesize of output 8165 [2022-07-20 05:43:02,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-07-20 05:43:02,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-07-20 05:43:03,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:03,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:03,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:03,803 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-07-20 05:43:03,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 84 [2022-07-20 05:43:03,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:03,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:03,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:03,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:03,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2022-07-20 05:43:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:03,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463165861] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:43:03,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:43:03,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16] total 39 [2022-07-20 05:43:03,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747047946] [2022-07-20 05:43:03,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:43:03,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-20 05:43:03,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:03,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-20 05:43:03,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1329, Unknown=9, NotChecked=0, Total=1482 [2022-07-20 05:43:03,971 INFO L87 Difference]: Start difference. First operand 215 states and 249 transitions. Second operand has 39 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 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) [2022-07-20 05:43:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:20,388 INFO L93 Difference]: Finished difference Result 411 states and 471 transitions. [2022-07-20 05:43:20,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-20 05:43:20,388 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 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) Word has length 31 [2022-07-20 05:43:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:20,389 INFO L225 Difference]: With dead ends: 411 [2022-07-20 05:43:20,389 INFO L226 Difference]: Without dead ends: 411 [2022-07-20 05:43:20,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=517, Invalid=4159, Unknown=16, NotChecked=0, Total=4692 [2022-07-20 05:43:20,391 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 144 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 573 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:20,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 619 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 571 Invalid, 0 Unknown, 573 Unchecked, 0.4s Time] [2022-07-20 05:43:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-07-20 05:43:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 343. [2022-07-20 05:43:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.1957831325301205) internal successors, (397), 342 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 397 transitions. [2022-07-20 05:43:20,397 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 397 transitions. Word has length 31 [2022-07-20 05:43:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:20,398 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 397 transitions. [2022-07-20 05:43:20,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 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) [2022-07-20 05:43:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 397 transitions. [2022-07-20 05:43:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 05:43:20,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:20,399 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:20,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-20 05:43:20,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-20 05:43:20,612 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:43:20,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:20,612 INFO L85 PathProgramCache]: Analyzing trace with hash 678570018, now seen corresponding path program 1 times [2022-07-20 05:43:20,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:20,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926661400] [2022-07-20 05:43:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:20,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:20,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:20,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926661400] [2022-07-20 05:43:20,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926661400] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:43:20,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228095529] [2022-07-20 05:43:20,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:20,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:43:20,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:43:20,736 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:43:20,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 05:43:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:20,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 05:43:20,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:43:20,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:20,895 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:43:20,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:43:20,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:20,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-20 05:43:21,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:21,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 38 [2022-07-20 05:43:21,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:21,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:21,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 28 [2022-07-20 05:43:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:21,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:43:21,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (v_ArrVal_1292 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_52| Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1292) |v_ULTIMATE.start_main_~list~0#1.offset_52|) 1) |c_#StackHeapBarrier|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_52|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_52| |c_ULTIMATE.start_main_~y~0#1.offset|)))) is different from false [2022-07-20 05:43:21,846 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:21,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 26 [2022-07-20 05:43:21,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 40 [2022-07-20 05:43:21,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:21,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:21,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2022-07-20 05:43:21,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:21,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-20 05:43:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:21,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228095529] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:43:21,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:43:21,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 21 [2022-07-20 05:43:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832762852] [2022-07-20 05:43:21,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:43:21,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 05:43:21,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:21,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 05:43:21,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=357, Unknown=2, NotChecked=38, Total=462 [2022-07-20 05:43:21,993 INFO L87 Difference]: Start difference. First operand 343 states and 397 transitions. Second operand has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:22,547 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (<= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1291 (Array Int Int)) (v_ArrVal_1292 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_52| Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1292) |v_ULTIMATE.start_main_~list~0#1.offset_52|) 1) |c_#StackHeapBarrier|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_52|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_52| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ |c_ULTIMATE.start_main_~y~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_main_~list~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1)) is different from false [2022-07-20 05:43:22,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:22,952 INFO L93 Difference]: Finished difference Result 448 states and 511 transitions. [2022-07-20 05:43:22,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:43:22,952 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 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 [2022-07-20 05:43:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:22,954 INFO L225 Difference]: With dead ends: 448 [2022-07-20 05:43:22,954 INFO L226 Difference]: Without dead ends: 448 [2022-07-20 05:43:22,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=154, Invalid=843, Unknown=3, NotChecked=122, Total=1122 [2022-07-20 05:43:22,955 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 74 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:22,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 291 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 520 Invalid, 0 Unknown, 302 Unchecked, 0.3s Time] [2022-07-20 05:43:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-07-20 05:43:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 425. [2022-07-20 05:43:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 414 states have (on average 1.1956521739130435) internal successors, (495), 424 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 495 transitions. [2022-07-20 05:43:22,962 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 495 transitions. Word has length 31 [2022-07-20 05:43:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:22,962 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 495 transitions. [2022-07-20 05:43:22,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 495 transitions. [2022-07-20 05:43:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 05:43:22,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:22,963 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:22,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 05:43:23,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-20 05:43:23,187 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:43:23,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:23,187 INFO L85 PathProgramCache]: Analyzing trace with hash 300693927, now seen corresponding path program 1 times [2022-07-20 05:43:23,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:23,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922282183] [2022-07-20 05:43:23,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:23,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:23,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:23,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:23,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922282183] [2022-07-20 05:43:23,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922282183] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:43:23,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235221456] [2022-07-20 05:43:23,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:23,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:43:23,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:43:23,440 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:43:23,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 05:43:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:23,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-20 05:43:23,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:43:23,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:23,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:23,656 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:43:23,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 18 [2022-07-20 05:43:23,675 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:43:23,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:43:23,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:23,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:23,748 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:43:23,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 05:43:23,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:43:23,798 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-20 05:43:23,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-20 05:43:23,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:23,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:23,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:23,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 30 [2022-07-20 05:43:23,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:23,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:24,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:24,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:24,132 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-20 05:43:24,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 41 [2022-07-20 05:43:24,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:24,385 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-20 05:43:24,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 33 [2022-07-20 05:43:24,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-20 05:43:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:24,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:43:24,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 36 [2022-07-20 05:43:32,403 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_58| Int) (v_ArrVal_1391 Int) (v_ArrVal_1395 Int) (v_ArrVal_1389 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_20| Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~y~0#1.base|) .cse3 |v_ULTIMATE.start_main_#t~malloc8#1.base_20|))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1389) |c_ULTIMATE.start_main_~y~0#1.base|) .cse3 v_ArrVal_1395) |v_ULTIMATE.start_main_~list~0#1.offset_58|)) (.cse1 (select .cse2 |v_ULTIMATE.start_main_~list~0#1.offset_58|))) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_58|)) (<= (+ .cse0 12) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc8#1.base_20| v_ArrVal_1391) .cse1)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_58| |c_ULTIMATE.start_main_~y~0#1.offset|)) (< .cse0 0) (and (= .cse1 (select .cse2 8)) (not (= .cse1 |c_ULTIMATE.start_main_~y~0#1.base|)))))))) is different from false [2022-07-20 05:43:32,415 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:32,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 119 treesize of output 95 [2022-07-20 05:43:32,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 176 treesize of output 166 [2022-07-20 05:43:32,428 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:32,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 107 treesize of output 91 [2022-07-20 05:43:32,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 169 treesize of output 161 [2022-07-20 05:43:32,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:32,455 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:32,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 140 treesize of output 150 [2022-07-20 05:43:32,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:32,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 111 treesize of output 105 [2022-07-20 05:43:32,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:32,479 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:32,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 118 [2022-07-20 05:43:32,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:32,492 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:32,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 90 treesize of output 90 [2022-07-20 05:43:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:33,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235221456] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:43:33,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:43:33,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 19] total 47 [2022-07-20 05:43:33,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462311441] [2022-07-20 05:43:33,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:43:33,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-20 05:43:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:33,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-20 05:43:33,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1960, Unknown=10, NotChecked=90, Total=2256 [2022-07-20 05:43:33,255 INFO L87 Difference]: Start difference. First operand 425 states and 495 transitions. Second operand has 48 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 48 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) [2022-07-20 05:43:34,536 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse0 (select |c_#length| |c_ULTIMATE.start_main_~y~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (<= 13 .cse0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_1390 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_58| Int) (v_ArrVal_1391 Int) (v_ArrVal_1395 Int) (v_ArrVal_1389 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_20| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse3 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~y~0#1.base|) .cse4 |v_ULTIMATE.start_main_#t~malloc8#1.base_20|))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1389) |c_ULTIMATE.start_main_~y~0#1.base|) .cse4 v_ArrVal_1395) |v_ULTIMATE.start_main_~list~0#1.offset_58|)) (.cse2 (select .cse3 |v_ULTIMATE.start_main_~list~0#1.offset_58|))) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_58|)) (<= (+ .cse1 12) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc8#1.base_20| v_ArrVal_1391) .cse2)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_58| |c_ULTIMATE.start_main_~y~0#1.offset|)) (< .cse1 0) (and (= .cse2 (select .cse3 8)) (not (= .cse2 |c_ULTIMATE.start_main_~y~0#1.base|)))))))) (<= .cse5 13) (<= .cse0 13) (= (select |c_#valid| .cse6) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) 0) (= .cse5 13) (= .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (<= 13 .cse5) (= 13 (select |c_#length| .cse6)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (= (+ |c_ULTIMATE.start_main_~list~0#1.offset| (* (- 1) |c_ULTIMATE.start_main_~y~0#1.offset|)) 0) (= (+ (- 13) .cse0) 0))) is different from false [2022-07-20 05:43:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:37,385 INFO L93 Difference]: Finished difference Result 425 states and 489 transitions. [2022-07-20 05:43:37,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 05:43:37,387 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 48 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) Word has length 33 [2022-07-20 05:43:37,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:37,389 INFO L225 Difference]: With dead ends: 425 [2022-07-20 05:43:37,389 INFO L226 Difference]: Without dead ends: 425 [2022-07-20 05:43:37,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=518, Invalid=3767, Unknown=13, NotChecked=258, Total=4556 [2022-07-20 05:43:37,390 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 120 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:37,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 448 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 565 Invalid, 0 Unknown, 335 Unchecked, 0.4s Time] [2022-07-20 05:43:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-07-20 05:43:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 411. [2022-07-20 05:43:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 400 states have (on average 1.1875) internal successors, (475), 410 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:37,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 475 transitions. [2022-07-20 05:43:37,397 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 475 transitions. Word has length 33 [2022-07-20 05:43:37,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:37,397 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 475 transitions. [2022-07-20 05:43:37,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 48 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) [2022-07-20 05:43:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 475 transitions. [2022-07-20 05:43:37,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 05:43:37,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:37,398 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:37,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-20 05:43:37,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-20 05:43:37,622 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:43:37,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:37,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1131545711, now seen corresponding path program 2 times [2022-07-20 05:43:37,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:37,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266515088] [2022-07-20 05:43:37,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:37,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:37,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:37,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266515088] [2022-07-20 05:43:37,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266515088] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:43:37,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212694191] [2022-07-20 05:43:37,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:43:37,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:43:37,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:43:37,844 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:43:37,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 05:43:37,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:43:37,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:43:37,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-20 05:43:37,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:43:37,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:38,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:38,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:38,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:38,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:38,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:38,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:38,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:38,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:38,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:38,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:38,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:38,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 05:43:38,153 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:43:38,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:43:38,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-20 05:43:38,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-20 05:43:38,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:38,249 INFO L356 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-07-20 05:43:38,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 84 treesize of output 68 [2022-07-20 05:43:38,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:38,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2022-07-20 05:43:38,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:38,307 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:43:38,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 41 [2022-07-20 05:43:38,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:43:38,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:38,561 INFO L356 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2022-07-20 05:43:38,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 42 [2022-07-20 05:43:38,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:38,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 [2022-07-20 05:43:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:38,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:43:40,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1502 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_64| Int) (v_ArrVal_1503 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_65| Int)) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1503))) (let ((.cse0 (select .cse1 |v_ULTIMATE.start_main_~list~0#1.offset_65|))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1502) .cse0) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| .cse1) .cse0) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0)))) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_65| |c_ULTIMATE.start_main_~y~0#1.offset|)) (< 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_65|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|)))) is different from false [2022-07-20 05:43:41,142 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 Int) (v_ArrVal_1500 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_64| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_65| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_65| |c_ULTIMATE.start_main_~y~0#1.offset|)) (and (forall ((v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1503 Int)) (= (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0 v_ArrVal_1500)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1502) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0 v_ArrVal_1499)) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1503) |v_ULTIMATE.start_main_~list~0#1.offset_65|))) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0)) (forall ((v_ArrVal_1503 Int)) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4) v_ArrVal_1499)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1503))) (select (store .cse1 |c_ULTIMATE.start_main_~y~0#1.base| .cse2) (select .cse2 |v_ULTIMATE.start_main_~list~0#1.offset_65|)))) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0))) (< 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_65|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|)))) is different from false [2022-07-20 05:43:41,237 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1496 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_64| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_65| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_65| |c_ULTIMATE.start_main_~y~0#1.offset|)) (< 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|) (and (forall ((v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1499 Int) (v_ArrVal_1500 Int) (v_ArrVal_1503 Int)) (= (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1496))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1 v_ArrVal_1500))) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1502) (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1 v_ArrVal_1499))) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1503) |v_ULTIMATE.start_main_~list~0#1.offset_65|))) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0)) (forall ((v_ArrVal_1499 Int) (v_ArrVal_1503 Int)) (= (select (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4) v_ArrVal_1499))))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1503))) (select (store .cse3 |c_ULTIMATE.start_main_~y~0#1.base| .cse4) (select .cse4 |v_ULTIMATE.start_main_~list~0#1.offset_65|)))) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0))) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_65|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|)))) is different from false [2022-07-20 05:43:41,630 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_64| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_65| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_66| Int) (|v_ULTIMATE.start_main_~y~0#1.base_82| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_65| 0)) (not (<= |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_66|)) (< 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_65|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|)) (and (forall ((v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1499 Int) (v_ArrVal_1496 (Array Int Int)) (v_ArrVal_1500 Int) (v_ArrVal_1503 Int)) (= (select (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_66|))) (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~y~0#1.base_82| v_ArrVal_1496))) (store .cse0 |c_ULTIMATE.start_main_~y~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1500))) |v_ULTIMATE.start_main_~y~0#1.base_82| v_ArrVal_1502) (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~y~0#1.base_82| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~y~0#1.base_82|) 0 |c_ULTIMATE.start_main_~y~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_main_~y~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1499))) |v_ULTIMATE.start_main_~y~0#1.base_82|) 8 v_ArrVal_1503) |v_ULTIMATE.start_main_~list~0#1.offset_65|))) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0)) (forall ((v_ArrVal_1499 Int) (v_ArrVal_1503 Int)) (= (select (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~y~0#1.base_82| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~y~0#1.base_82|) 0 |c_ULTIMATE.start_main_~y~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_main_~y~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~y~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_66|) v_ArrVal_1499))))) (let ((.cse4 (store (select .cse3 |v_ULTIMATE.start_main_~y~0#1.base_82|) 8 v_ArrVal_1503))) (select (store .cse3 |v_ULTIMATE.start_main_~y~0#1.base_82| .cse4) (select .cse4 |v_ULTIMATE.start_main_~list~0#1.offset_65|)))) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~y~0#1.base_82|) 0)))) is different from false [2022-07-20 05:43:42,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1488 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_64| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_65| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_66| Int) (|v_ULTIMATE.start_main_~y~0#1.base_82| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_65| 0)) (not (<= |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_66|)) (< 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|) (and (forall ((v_ArrVal_1493 Int) (v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1494 Int) (v_ArrVal_1499 Int) (v_ArrVal_1496 (Array Int Int)) (v_ArrVal_1500 Int) (v_ArrVal_1503 Int)) (= (select (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_66|)) (.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_1488) .cse3 v_ArrVal_1494)) |v_ULTIMATE.start_main_~y~0#1.base_82| v_ArrVal_1496))) (store .cse0 |c_ULTIMATE.start_main_~y~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1500))) |v_ULTIMATE.start_main_~y~0#1.base_82| v_ArrVal_1502) (select (store (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 0) .cse3 v_ArrVal_1493)))) (store .cse5 |v_ULTIMATE.start_main_~y~0#1.base_82| (store (select .cse5 |v_ULTIMATE.start_main_~y~0#1.base_82|) 0 |c_ULTIMATE.start_main_~y~0#1.base|))))) (store .cse4 |c_ULTIMATE.start_main_~y~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1499))) |v_ULTIMATE.start_main_~y~0#1.base_82|) 8 v_ArrVal_1503) |v_ULTIMATE.start_main_~list~0#1.offset_65|))) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0)) (forall ((v_ArrVal_1493 Int) (v_ArrVal_1499 Int) (v_ArrVal_1503 Int)) (= (select (let ((.cse6 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4) 0) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1493)))) (store .cse9 |v_ULTIMATE.start_main_~y~0#1.base_82| (store (select .cse9 |v_ULTIMATE.start_main_~y~0#1.base_82|) 0 |c_ULTIMATE.start_main_~y~0#1.base|))))) (store .cse8 |c_ULTIMATE.start_main_~y~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~y~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_66|) v_ArrVal_1499))))) (let ((.cse7 (store (select .cse6 |v_ULTIMATE.start_main_~y~0#1.base_82|) 8 v_ArrVal_1503))) (select (store .cse6 |v_ULTIMATE.start_main_~y~0#1.base_82| .cse7) (select .cse7 |v_ULTIMATE.start_main_~list~0#1.offset_65|)))) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0))) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_65|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~y~0#1.base_82|) 0)))) is different from false [2022-07-20 05:43:42,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:42,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:42,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:42,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:42,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:42,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:42,373 INFO L356 Elim1Store]: treesize reduction 298, result has 34.2 percent of original size [2022-07-20 05:43:42,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 58912 treesize of output 8225 [2022-07-20 05:43:42,520 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-20 05:43:42,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 8752 treesize of output 7513 [2022-07-20 05:43:42,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-07-20 05:43:52,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:52,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:52,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 77 [2022-07-20 05:43:52,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:52,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:52,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:52,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:52,746 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:52,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 212 treesize of output 198 [2022-07-20 05:43:52,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:52,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:52,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:52,848 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:52,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 160 [2022-07-20 05:43:52,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:52,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:52,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:52,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:52,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:52,914 INFO L356 Elim1Store]: treesize reduction 137, result has 32.2 percent of original size [2022-07-20 05:43:52,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 131 treesize of output 98 [2022-07-20 05:43:52,937 INFO L356 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2022-07-20 05:43:52,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4496 treesize of output 4328 [2022-07-20 05:43:52,979 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:52,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4372 treesize of output 3804 [2022-07-20 05:43:53,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:53,013 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:53,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3736 treesize of output 3698 [2022-07-20 05:43:53,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:53,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3526 treesize of output 3426 [2022-07-20 05:43:53,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3426 treesize of output 3282 [2022-07-20 05:43:53,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:53,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-20 05:44:20,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:20,888 INFO L356 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-07-20 05:44:20,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2022-07-20 05:44:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:21,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212694191] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:44:21,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:44:21,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 18] total 41 [2022-07-20 05:44:21,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138077582] [2022-07-20 05:44:21,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:44:21,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-20 05:44:21,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:44:21,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-20 05:44:21,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1151, Unknown=9, NotChecked=360, Total=1640 [2022-07-20 05:44:21,003 INFO L87 Difference]: Start difference. First operand 411 states and 475 transitions. Second operand has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:26,195 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (<= 0 |c_ULTIMATE.start_main_~list~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select .cse1 4) 0) (= (select .cse1 |c_ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_ArrVal_1496 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_64| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_65| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_65| |c_ULTIMATE.start_main_~y~0#1.offset|)) (< 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|) (and (forall ((v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1499 Int) (v_ArrVal_1500 Int) (v_ArrVal_1503 Int)) (= (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1496))) (store .cse2 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse3 v_ArrVal_1500))) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1502) (select (store (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse3 v_ArrVal_1499))) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1503) |v_ULTIMATE.start_main_~list~0#1.offset_65|))) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0)) (forall ((v_ArrVal_1499 Int) (v_ArrVal_1503 Int)) (= (select (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)))) (store .cse7 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4) v_ArrVal_1499))))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1503))) (select (store .cse5 |c_ULTIMATE.start_main_~y~0#1.base| .cse6) (select .cse6 |v_ULTIMATE.start_main_~list~0#1.offset_65|)))) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0))) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_65|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|)))) (= (select .cse1 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (= (select .cse0 0) 0))) is different from false [2022-07-20 05:44:28,199 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (<= 0 |c_ULTIMATE.start_main_~list~0#1.offset|) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (select .cse0 4) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|) (= (select .cse0 .cse1) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select .cse0 0) 0) (= (select .cse2 0) 0) (= (select .cse2 .cse1) 0) (forall ((v_ArrVal_1499 Int) (v_ArrVal_1500 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_64| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_65| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_65| |c_ULTIMATE.start_main_~y~0#1.offset|)) (and (forall ((v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1503 Int)) (= (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse3 v_ArrVal_1500)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1502) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse3 v_ArrVal_1499)) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1503) |v_ULTIMATE.start_main_~list~0#1.offset_65|))) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0)) (forall ((v_ArrVal_1503 Int)) (= (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4) v_ArrVal_1499)))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1503))) (select (store .cse4 |c_ULTIMATE.start_main_~y~0#1.base| .cse5) (select .cse5 |v_ULTIMATE.start_main_~list~0#1.offset_65|)))) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0))) (< 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_65|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|)))) (not (= (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4) .cse1)))) is different from false [2022-07-20 05:44:28,204 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse3)) (.cse0 (select |c_#memory_$Pointer$.offset| .cse3)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (select .cse0 0) 0) (forall ((v_ArrVal_1502 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_64| Int) (v_ArrVal_1503 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_65| Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1503))) (let ((.cse1 (select .cse2 |v_ULTIMATE.start_main_~list~0#1.offset_65|))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1502) .cse1) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| .cse2) .cse1) |v_ULTIMATE.start_main_~list~0#1.offset_64|) 0)))) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_65| |c_ULTIMATE.start_main_~y~0#1.offset|)) (< 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_65|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_64|)))) (not (= .cse3 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select .cse4 .cse5) 0) (= (select .cse4 0) 0) (= 0 (select .cse0 .cse5))))) is different from false [2022-07-20 05:44:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:44:28,641 INFO L93 Difference]: Finished difference Result 429 states and 493 transitions. [2022-07-20 05:44:28,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:44:28,642 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 05:44:28,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:44:28,643 INFO L225 Difference]: With dead ends: 429 [2022-07-20 05:44:28,643 INFO L226 Difference]: Without dead ends: 429 [2022-07-20 05:44:28,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=242, Invalid=2129, Unknown=13, NotChecked=808, Total=3192 [2022-07-20 05:44:28,645 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 43 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 532 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:44:28,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 620 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 320 Invalid, 0 Unknown, 532 Unchecked, 0.2s Time] [2022-07-20 05:44:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-07-20 05:44:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 428. [2022-07-20 05:44:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 417 states have (on average 1.1798561151079137) internal successors, (492), 427 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 492 transitions. [2022-07-20 05:44:28,652 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 492 transitions. Word has length 34 [2022-07-20 05:44:28,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:44:28,652 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 492 transitions. [2022-07-20 05:44:28,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:28,652 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 492 transitions. [2022-07-20 05:44:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 05:44:28,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:44:28,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:44:28,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 05:44:28,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-20 05:44:28,854 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:44:28,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:44:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash -718179577, now seen corresponding path program 2 times [2022-07-20 05:44:28,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:44:28,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226014675] [2022-07-20 05:44:28,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:44:28,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:44:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:44:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:29,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:44:29,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226014675] [2022-07-20 05:44:29,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226014675] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:44:29,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631452886] [2022-07-20 05:44:29,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:44:29,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:44:29,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:44:29,120 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:44:29,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 05:44:29,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:44:29,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:44:29,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-20 05:44:29,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:44:29,315 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 05:44:29,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 44 [2022-07-20 05:44:29,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:29,403 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:44:29,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 53 [2022-07-20 05:44:29,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:29,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 44 [2022-07-20 05:44:29,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:29,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 31 [2022-07-20 05:44:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:29,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:44:31,072 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1594 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_70| Int) (v_ArrVal_1593 (Array Int Int))) (or (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1593) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1594) |v_ULTIMATE.start_main_~list~0#1.offset_70|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_70|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_70| |c_ULTIMATE.start_main_~y~0#1.offset|)))) is different from false [2022-07-20 05:44:31,079 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:31,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 34 [2022-07-20 05:44:31,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 56 [2022-07-20 05:44:31,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:31,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 17 [2022-07-20 05:44:31,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:31,093 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:31,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 31 [2022-07-20 05:44:39,301 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 05:44:49,421 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 05:44:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:49,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631452886] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:44:49,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:44:49,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 32 [2022-07-20 05:44:49,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955932125] [2022-07-20 05:44:49,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:44:49,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-20 05:44:49,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:44:49,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-20 05:44:49,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=888, Unknown=3, NotChecked=60, Total=1056 [2022-07-20 05:44:49,527 INFO L87 Difference]: Start difference. First operand 428 states and 492 transitions. Second operand has 33 states, 32 states have (on average 2.75) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:50,346 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= .cse0 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base| .cse0) |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_ArrVal_1594 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_70| Int) (v_ArrVal_1593 (Array Int Int))) (or (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1593) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1594) |v_ULTIMATE.start_main_~list~0#1.offset_70|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_70|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_70| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base|) 0))) is different from false [2022-07-20 05:44:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:44:50,731 INFO L93 Difference]: Finished difference Result 430 states and 493 transitions. [2022-07-20 05:44:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:44:50,734 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.75) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 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 35 [2022-07-20 05:44:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:44:50,735 INFO L225 Difference]: With dead ends: 430 [2022-07-20 05:44:50,735 INFO L226 Difference]: Without dead ends: 411 [2022-07-20 05:44:50,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=177, Invalid=1233, Unknown=4, NotChecked=146, Total=1560 [2022-07-20 05:44:50,736 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 394 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:44:50,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 328 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 449 Invalid, 0 Unknown, 394 Unchecked, 0.2s Time] [2022-07-20 05:44:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-07-20 05:44:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2022-07-20 05:44:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 400 states have (on average 1.185) internal successors, (474), 410 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 474 transitions. [2022-07-20 05:44:50,743 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 474 transitions. Word has length 35 [2022-07-20 05:44:50,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:44:50,743 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 474 transitions. [2022-07-20 05:44:50,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.75) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 474 transitions. [2022-07-20 05:44:50,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 05:44:50,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:44:50,744 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:44:50,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-20 05:44:50,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:44:50,960 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:44:50,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:44:50,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1062917671, now seen corresponding path program 3 times [2022-07-20 05:44:50,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:44:50,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678683146] [2022-07-20 05:44:50,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:44:50,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:44:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:44:51,086 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:51,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:44:51,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678683146] [2022-07-20 05:44:51,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678683146] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:44:51,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487697338] [2022-07-20 05:44:51,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:44:51,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:44:51,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:44:51,092 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:44:51,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 05:44:51,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 05:44:51,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:44:51,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 05:44:51,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:44:51,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:51,337 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:44:51,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:44:51,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:51,383 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:44:51,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 [2022-07-20 05:44:51,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:51,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 25 [2022-07-20 05:44:51,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:51,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:51,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 15 [2022-07-20 05:44:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:51,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:44:52,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1723 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_74| Int) (v_ArrVal_1725 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_74|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_74| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1723) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1725) |v_ULTIMATE.start_main_~list~0#1.offset_74|) 0)))) is different from false [2022-07-20 05:44:52,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:52,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 25 [2022-07-20 05:44:52,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2022-07-20 05:44:52,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:52,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 25 [2022-07-20 05:44:52,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:52,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:52,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 31 [2022-07-20 05:44:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 05:44:52,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487697338] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:44:52,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:44:52,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 22 [2022-07-20 05:44:52,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107692165] [2022-07-20 05:44:52,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:44:52,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 05:44:52,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:44:52,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 05:44:52,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=357, Unknown=2, NotChecked=38, Total=462 [2022-07-20 05:44:52,338 INFO L87 Difference]: Start difference. First operand 411 states and 474 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:52,968 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (forall ((v_ArrVal_1723 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_74| Int) (v_ArrVal_1725 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_74|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_74| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1723) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1725) |v_ULTIMATE.start_main_~list~0#1.offset_74|) 0))))) is different from false [2022-07-20 05:44:53,659 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse0 (select .cse1 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) (not (= (select .cse1 |c_ULTIMATE.start_main_~list~0#1.offset|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (forall ((v_ArrVal_1723 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_74| Int) (v_ArrVal_1725 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_74|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_74| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1723) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1725) |v_ULTIMATE.start_main_~list~0#1.offset_74|) 0)))) (not (= .cse0 |c_ULTIMATE.start_main_~list~0#1.base|))))) is different from false [2022-07-20 05:44:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:44:53,784 INFO L93 Difference]: Finished difference Result 460 states and 522 transitions. [2022-07-20 05:44:53,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:44:53,785 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 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 35 [2022-07-20 05:44:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:44:53,786 INFO L225 Difference]: With dead ends: 460 [2022-07-20 05:44:53,786 INFO L226 Difference]: Without dead ends: 460 [2022-07-20 05:44:53,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=247, Invalid=951, Unknown=4, NotChecked=204, Total=1406 [2022-07-20 05:44:53,787 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 94 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:44:53,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 247 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 355 Invalid, 0 Unknown, 242 Unchecked, 0.2s Time] [2022-07-20 05:44:53,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-07-20 05:44:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 372. [2022-07-20 05:44:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 361 states have (on average 1.188365650969529) internal successors, (429), 371 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 429 transitions. [2022-07-20 05:44:53,793 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 429 transitions. Word has length 35 [2022-07-20 05:44:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:44:53,793 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 429 transitions. [2022-07-20 05:44:53,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 429 transitions. [2022-07-20 05:44:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:44:53,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:44:53,794 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:44:53,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-20 05:44:54,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-20 05:44:54,010 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:44:54,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:44:54,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1409319489, now seen corresponding path program 2 times [2022-07-20 05:44:54,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:44:54,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467664400] [2022-07-20 05:44:54,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:44:54,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:44:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:44:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:54,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:44:54,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467664400] [2022-07-20 05:44:54,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467664400] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:44:54,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48428068] [2022-07-20 05:44:54,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:44:54,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:44:54,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:44:54,214 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:44:54,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 05:44:54,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:44:54,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:44:54,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-20 05:44:54,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:44:54,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:54,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:54,449 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:44:54,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:44:54,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:54,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:54,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:54,515 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:44:54,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 05:44:54,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:44:54,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:54,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-07-20 05:44:54,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:54,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:54,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:54,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-20 05:44:54,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:54,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:54,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:44:58,422 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1859 Int) (v_ArrVal_1856 (Array Int Int)) (v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1860 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_78| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1856) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1860) |v_ULTIMATE.start_main_~list~0#1.offset_78|))) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_78| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_78|)) (<= (+ 12 .cse0) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1855) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1859) |v_ULTIMATE.start_main_~list~0#1.offset_78|))) (< .cse0 0))))) is different from false [2022-07-20 05:44:58,434 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:58,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 63 [2022-07-20 05:44:58,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:58,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 40 [2022-07-20 05:44:58,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 68 [2022-07-20 05:44:58,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 157 treesize of output 149 [2022-07-20 05:44:58,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:58,466 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:58,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 56 [2022-07-20 05:44:58,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:58,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 42 [2022-07-20 05:44:58,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:58,487 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:58,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 92 treesize of output 92 [2022-07-20 05:44:58,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:58,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 65 [2022-07-20 05:44:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 05:44:58,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48428068] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:44:58,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:44:58,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 33 [2022-07-20 05:44:58,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800935627] [2022-07-20 05:44:58,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:44:58,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 05:44:58,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:44:58,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 05:44:58,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=939, Unknown=3, NotChecked=62, Total=1122 [2022-07-20 05:44:58,802 INFO L87 Difference]: Start difference. First operand 372 states and 429 transitions. Second operand has 34 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:59,828 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse0 (select |c_#length| |c_ULTIMATE.start_main_~y~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (<= 13 .cse0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= .cse1 13) (<= .cse0 13) (= .cse2 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (<= 13 .cse1) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= .cse0 .cse1) (<= .cse2 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (= (+ |c_ULTIMATE.start_main_~list~0#1.offset| (* (- 1) |c_ULTIMATE.start_main_~y~0#1.offset|)) 0) (<= .cse1 .cse0) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1856 (Array Int Int)) (v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1860 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_78| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse3 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1856) |c_ULTIMATE.start_main_~y~0#1.base|) .cse4 v_ArrVal_1860) |v_ULTIMATE.start_main_~list~0#1.offset_78|))) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_78| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_78|)) (<= (+ 12 .cse3) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1855) |c_ULTIMATE.start_main_~y~0#1.base|) .cse4 v_ArrVal_1859) |v_ULTIMATE.start_main_~list~0#1.offset_78|))) (< .cse3 0))))))) is different from false [2022-07-20 05:45:00,904 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse2 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_main_~y~0#1.base|)) (.cse5 (select .cse4 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) 0) (<= 13 .cse1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= .cse2 13) (<= .cse1 13) (<= (select .cse0 0) 0) (= .cse3 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (= .cse2 (select |c_#length| (select .cse4 |c_ULTIMATE.start_main_~list~0#1.offset|))) (<= 13 .cse2) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= .cse1 .cse2) (<= .cse3 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (not (= .cse5 |c_ULTIMATE.start_main_~list~0#1.base|)) (= (+ |c_ULTIMATE.start_main_~list~0#1.offset| (* (- 1) |c_ULTIMATE.start_main_~y~0#1.offset|)) 0) (<= .cse2 .cse1) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1856 (Array Int Int)) (v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1860 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_78| Int)) (let ((.cse7 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse6 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1856) |c_ULTIMATE.start_main_~y~0#1.base|) .cse7 v_ArrVal_1860) |v_ULTIMATE.start_main_~list~0#1.offset_78|))) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_78| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_78|)) (<= (+ 12 .cse6) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1855) |c_ULTIMATE.start_main_~y~0#1.base|) .cse7 v_ArrVal_1859) |v_ULTIMATE.start_main_~list~0#1.offset_78|))) (< .cse6 0))))) (<= 13 (select |c_#length| .cse5))))) is different from false [2022-07-20 05:45:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:45:01,303 INFO L93 Difference]: Finished difference Result 458 states and 524 transitions. [2022-07-20 05:45:01,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:45:01,303 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 05:45:01,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:45:01,304 INFO L225 Difference]: With dead ends: 458 [2022-07-20 05:45:01,304 INFO L226 Difference]: Without dead ends: 458 [2022-07-20 05:45:01,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=373, Invalid=1614, Unknown=5, NotChecked=264, Total=2256 [2022-07-20 05:45:01,306 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 208 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:45:01,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 272 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 523 Invalid, 0 Unknown, 189 Unchecked, 0.3s Time] [2022-07-20 05:45:01,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-07-20 05:45:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 368. [2022-07-20 05:45:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 357 states have (on average 1.184873949579832) internal successors, (423), 367 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 423 transitions. [2022-07-20 05:45:01,312 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 423 transitions. Word has length 36 [2022-07-20 05:45:01,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:45:01,313 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 423 transitions. [2022-07-20 05:45:01,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 423 transitions. [2022-07-20 05:45:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 05:45:01,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:45:01,314 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 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, 1] [2022-07-20 05:45:01,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-20 05:45:01,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-20 05:45:01,527 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:45:01,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:45:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash -789716468, now seen corresponding path program 1 times [2022-07-20 05:45:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:45:01,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58430936] [2022-07-20 05:45:01,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:45:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:45:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:45:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:45:01,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:45:01,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58430936] [2022-07-20 05:45:01,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58430936] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:45:01,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099518745] [2022-07-20 05:45:01,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:45:01,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:45:01,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:45:01,764 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:45:01,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-20 05:45:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:45:01,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-20 05:45:01,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:45:01,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:01,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:01,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:01,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:45:01,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:01,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:45:01,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:01,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:45:01,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:01,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:45:01,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:01,985 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:45:01,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:45:02,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-20 05:45:02,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-20 05:45:02,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:45:02,054 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:45:02,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 54 [2022-07-20 05:45:02,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:45:02,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2022-07-20 05:45:02,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:45:02,119 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:45:02,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 50 [2022-07-20 05:45:02,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 27 [2022-07-20 05:45:02,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:02,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:02,527 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-20 05:45:02,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 53 [2022-07-20 05:45:02,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:45:02,540 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:45:02,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 28 [2022-07-20 05:45:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:45:02,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:45:02,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-07-20 05:45:04,306 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1964 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_84| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_85| Int) (v_ArrVal_1973 Int) (v_ArrVal_1967 Int)) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)))) (store .cse6 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4) v_ArrVal_1967))))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1973))) (let ((.cse0 (select .cse5 |v_ULTIMATE.start_main_~list~0#1.offset_85|))) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_85|)) (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|) (and (forall ((v_ArrVal_1972 (Array Int Int))) (= (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1964))) (store .cse1 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2 |c_ULTIMATE.start_main_~y~0#1.offset|))) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1972) (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2 v_ArrVal_1967))) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1973) |v_ULTIMATE.start_main_~list~0#1.offset_85|))) |v_ULTIMATE.start_main_~list~0#1.offset_84|) 0)) (= (select (select (store .cse4 |c_ULTIMATE.start_main_~y~0#1.base| .cse5) .cse0) |v_ULTIMATE.start_main_~list~0#1.offset_84|) 0)) (< |v_ULTIMATE.start_main_~list~0#1.offset_84| 0) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_85| |c_ULTIMATE.start_main_~y~0#1.offset|)) (< 0 |v_ULTIMATE.start_main_~list~0#1.offset_84|)))))) is different from false [2022-07-20 05:45:16,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:16,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:16,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:16,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:45:16,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 160 [2022-07-20 05:45:16,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:16,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:45:16,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 704 treesize of output 599 [2022-07-20 05:45:16,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 247 treesize of output 245 [2022-07-20 05:45:16,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:45:16,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 234 [2022-07-20 05:45:16,698 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:45:16,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 145 treesize of output 142 [2022-07-20 05:45:16,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:45:16,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:45:16,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:16,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:16,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:16,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:16,878 INFO L356 Elim1Store]: treesize reduction 340, result has 24.9 percent of original size [2022-07-20 05:45:16,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30044 treesize of output 4643 [2022-07-20 05:45:16,990 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-20 05:45:16,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 4970 treesize of output 4340 [2022-07-20 05:45:17,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-07-20 05:45:19,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:19,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-07-20 05:45:19,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:19,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:19,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:45:19,257 INFO L356 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-07-20 05:45:19,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 83 [2022-07-20 05:45:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:45:19,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099518745] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:45:19,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:45:19,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 20] total 44 [2022-07-20 05:45:19,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126382516] [2022-07-20 05:45:19,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:45:19,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-20 05:45:19,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:45:19,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-20 05:45:19,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1617, Unknown=50, NotChecked=82, Total=1892 [2022-07-20 05:45:19,829 INFO L87 Difference]: Start difference. First operand 368 states and 423 transitions. Second operand has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:20,052 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (<= 0 |c_ULTIMATE.start_main_~list~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_ArrVal_1964 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_84| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_85| Int) (v_ArrVal_1973 Int) (v_ArrVal_1967 Int)) (let ((.cse6 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)))) (store .cse8 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4) v_ArrVal_1967))))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1973))) (let ((.cse2 (select .cse7 |v_ULTIMATE.start_main_~list~0#1.offset_85|))) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_85|)) (= .cse2 |c_ULTIMATE.start_main_~y~0#1.base|) (and (forall ((v_ArrVal_1972 (Array Int Int))) (= (select (let ((.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1964))) (store .cse3 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 |c_ULTIMATE.start_main_~y~0#1.offset|))) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1972) (select (store (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1967))) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1973) |v_ULTIMATE.start_main_~list~0#1.offset_85|))) |v_ULTIMATE.start_main_~list~0#1.offset_84|) 0)) (= (select (select (store .cse6 |c_ULTIMATE.start_main_~y~0#1.base| .cse7) .cse2) |v_ULTIMATE.start_main_~list~0#1.offset_84|) 0)) (< |v_ULTIMATE.start_main_~list~0#1.offset_84| 0) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_85| |c_ULTIMATE.start_main_~y~0#1.offset|)) (< 0 |v_ULTIMATE.start_main_~list~0#1.offset_84|)))))) (= (select .cse1 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (= (select .cse0 0) 0))) is different from false [2022-07-20 05:45:39,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:45:39,867 INFO L93 Difference]: Finished difference Result 390 states and 445 transitions. [2022-07-20 05:45:39,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:45:39,867 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-20 05:45:39,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:45:39,868 INFO L225 Difference]: With dead ends: 390 [2022-07-20 05:45:39,869 INFO L226 Difference]: Without dead ends: 390 [2022-07-20 05:45:39,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=299, Invalid=3073, Unknown=58, NotChecked=230, Total=3660 [2022-07-20 05:45:39,870 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 80 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:45:39,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 679 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 354 Invalid, 0 Unknown, 417 Unchecked, 0.2s Time] [2022-07-20 05:45:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-07-20 05:45:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2022-07-20 05:45:39,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 378 states have (on average 1.1746031746031746) internal successors, (444), 388 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 444 transitions. [2022-07-20 05:45:39,876 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 444 transitions. Word has length 39 [2022-07-20 05:45:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:45:39,876 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 444 transitions. [2022-07-20 05:45:39,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 444 transitions. [2022-07-20 05:45:39,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 05:45:39,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:45:39,877 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:45:39,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-20 05:45:40,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:45:40,102 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-20 05:45:40,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:45:40,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1731582404, now seen corresponding path program 2 times [2022-07-20 05:45:40,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:45:40,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505865134] [2022-07-20 05:45:40,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:45:40,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:45:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:45:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:45:40,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:45:40,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505865134] [2022-07-20 05:45:40,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505865134] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:45:40,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215158208] [2022-07-20 05:45:40,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:45:40,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:45:40,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:45:40,490 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:45:40,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-20 05:45:40,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:45:40,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:45:40,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-20 05:45:40,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:45:40,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:40,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:40,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:40,740 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:45:40,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-20 05:45:40,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-07-20 05:45:40,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:40,842 INFO L356 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2022-07-20 05:45:40,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 103 treesize of output 80 [2022-07-20 05:45:40,853 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-20 05:45:40,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2022-07-20 05:45:40,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:45:40,915 INFO L356 Elim1Store]: treesize reduction 65, result has 16.7 percent of original size [2022-07-20 05:45:40,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 66 treesize of output 59 [2022-07-20 05:45:40,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:45:40,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2022-07-20 05:45:41,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:41,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:41,312 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-07-20 05:45:41,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 61 treesize of output 37 [2022-07-20 05:45:41,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:41,337 INFO L356 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2022-07-20 05:45:41,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 23 [2022-07-20 05:45:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:45:41,371 INFO L328 TraceCheckSpWp]: Computing backward predicates...