./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 791161d1 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-?-791161d [2022-07-23 05:56:12,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:56:12,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:56:12,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:56:12,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:56:12,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:56:12,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:56:12,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:56:12,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:56:12,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:56:12,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:56:12,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:56:12,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:56:12,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:56:12,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:56:12,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:56:12,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:56:12,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:56:12,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:56:12,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:56:12,743 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:56:12,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:56:12,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:56:12,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:56:12,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:56:12,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:56:12,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:56:12,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:56:12,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:56:12,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:56:12,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:56:12,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:56:12,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:56:12,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:56:12,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:56:12,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:56:12,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:56:12,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:56:12,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:56:12,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:56:12,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:56:12,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:56:12,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 05:56:12,784 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:56:12,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:56:12,785 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:56:12,785 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:56:12,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:56:12,785 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:56:12,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:56:12,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:56:12,786 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:56:12,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:56:12,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:56:12,787 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:56:12,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:56:12,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:56:12,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:56:12,788 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:56:12,788 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:56:12,788 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 05:56:12,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:56:12,789 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:56:12,789 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:56:12,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:56:12,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:56:12,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:56:12,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:56:12,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:56:12,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:56:12,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:56:12,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 05:56:12,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 05:56:12,791 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-23 05:56:12,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:56:13,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:56:13,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:56:13,008 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:56:13,008 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:56:13,010 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-23 05:56:13,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a2295cd3/514504d1f00a41e2bf49f53c0d150b73/FLAG1b6eaa677 [2022-07-23 05:56:13,468 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:56:13,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2022-07-23 05:56:13,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a2295cd3/514504d1f00a41e2bf49f53c0d150b73/FLAG1b6eaa677 [2022-07-23 05:56:13,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a2295cd3/514504d1f00a41e2bf49f53c0d150b73 [2022-07-23 05:56:13,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:56:13,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:56:13,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:56:13,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:56:13,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:56:13,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:56:13" (1/1) ... [2022-07-23 05:56:13,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267c16c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:56:13, skipping insertion in model container [2022-07-23 05:56:13,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:56:13" (1/1) ... [2022-07-23 05:56:13,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:56:13,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:56:14,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:56:14,163 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:56:14,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:56:14,220 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:56:14,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:56:14 WrapperNode [2022-07-23 05:56:14,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:56:14,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:56:14,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:56:14,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:56:14,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:56:14" (1/1) ... [2022-07-23 05:56:14,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:56:14" (1/1) ... [2022-07-23 05:56:14,270 INFO L137 Inliner]: procedures = 123, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2022-07-23 05:56:14,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:56:14,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:56:14,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:56:14,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:56:14,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:56:14" (1/1) ... [2022-07-23 05:56:14,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:56:14" (1/1) ... [2022-07-23 05:56:14,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:56:14" (1/1) ... [2022-07-23 05:56:14,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:56:14" (1/1) ... [2022-07-23 05:56:14,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:56:14" (1/1) ... [2022-07-23 05:56:14,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:56:14" (1/1) ... [2022-07-23 05:56:14,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:56:14" (1/1) ... [2022-07-23 05:56:14,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:56:14,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:56:14,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:56:14,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:56:14,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:56:14" (1/1) ... [2022-07-23 05:56:14,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:56:14,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:14,337 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-23 05:56:14,339 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-23 05:56:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 05:56:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 05:56:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 05:56:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 05:56:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:56:14,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 05:56:14,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:56:14,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:56:14,427 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:56:14,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:56:14,573 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:56:14,578 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:56:14,578 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 05:56:14,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:56:14 BoogieIcfgContainer [2022-07-23 05:56:14,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:56:14,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:56:14,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:56:14,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:56:14,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:56:13" (1/3) ... [2022-07-23 05:56:14,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d807b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:56:14, skipping insertion in model container [2022-07-23 05:56:14,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:56:14" (2/3) ... [2022-07-23 05:56:14,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d807b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:56:14, skipping insertion in model container [2022-07-23 05:56:14,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:56:14" (3/3) ... [2022-07-23 05:56:14,610 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2022-07-23 05:56:14,632 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:56:14,633 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-23 05:56:14,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:56:14,673 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@1da20ceb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@61960a1c [2022-07-23 05:56:14,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-23 05:56:14,676 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-23 05:56:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 05:56:14,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:14,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 05:56:14,681 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-23 05:56:14,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:14,685 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-23 05:56:14,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:14,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026183831] [2022-07-23 05:56:14,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:14,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:14,801 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-23 05:56:14,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:14,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026183831] [2022-07-23 05:56:14,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026183831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:14,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:14,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:56:14,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029516704] [2022-07-23 05:56:14,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:14,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:56:14,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:14,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:56:14,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:56:14,831 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-23 05:56:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:14,918 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-07-23 05:56:14,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:56:14,920 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-23 05:56:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:14,925 INFO L225 Difference]: With dead ends: 63 [2022-07-23 05:56:14,926 INFO L226 Difference]: Without dead ends: 59 [2022-07-23 05:56:14,927 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-23 05:56:14,932 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:14,932 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-23 05:56:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-23 05:56:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-07-23 05:56:14,953 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-23 05:56:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-07-23 05:56:14,954 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 3 [2022-07-23 05:56:14,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:14,955 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-07-23 05:56:14,955 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-23 05:56:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-07-23 05:56:14,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 05:56:14,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:14,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 05:56:14,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 05:56:14,956 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-23 05:56:14,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:14,957 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 05:56:14,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:14,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913107958] [2022-07-23 05:56:14,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:14,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:14,996 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-23 05:56:14,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:14,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913107958] [2022-07-23 05:56:14,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913107958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:14,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:14,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:56:14,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375336245] [2022-07-23 05:56:14,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:14,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:56:14,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:14,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:56:14,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:56:14,999 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-23 05:56:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:15,038 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-07-23 05:56:15,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:56:15,038 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-23 05:56:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:15,039 INFO L225 Difference]: With dead ends: 55 [2022-07-23 05:56:15,039 INFO L226 Difference]: Without dead ends: 55 [2022-07-23 05:56:15,040 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-23 05:56:15,041 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-23 05:56:15,041 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-23 05:56:15,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-23 05:56:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2022-07-23 05:56:15,050 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-23 05:56:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-07-23 05:56:15,052 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 3 [2022-07-23 05:56:15,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:15,053 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-07-23 05:56:15,053 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-23 05:56:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-07-23 05:56:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 05:56:15,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:15,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:56:15,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 05:56:15,055 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-23 05:56:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:15,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897518, now seen corresponding path program 1 times [2022-07-23 05:56:15,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:15,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910323643] [2022-07-23 05:56:15,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:15,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:15,101 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-23 05:56:15,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:15,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910323643] [2022-07-23 05:56:15,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910323643] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:15,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:15,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:56:15,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095710233] [2022-07-23 05:56:15,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:15,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:56:15,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:15,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:56:15,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:56:15,104 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-23 05:56:15,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:15,179 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-07-23 05:56:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:56:15,180 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-23 05:56:15,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:15,182 INFO L225 Difference]: With dead ends: 58 [2022-07-23 05:56:15,182 INFO L226 Difference]: Without dead ends: 58 [2022-07-23 05:56:15,183 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-23 05:56:15,187 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-23 05:56:15,190 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-23 05:56:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-23 05:56:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2022-07-23 05:56:15,195 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-23 05:56:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-23 05:56:15,196 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 10 [2022-07-23 05:56:15,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:15,196 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-23 05:56:15,196 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-23 05:56:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-23 05:56:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 05:56:15,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:15,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:56:15,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 05:56:15,199 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-23 05:56:15,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897519, now seen corresponding path program 1 times [2022-07-23 05:56:15,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:15,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152834146] [2022-07-23 05:56:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:15,275 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-23 05:56:15,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:15,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152834146] [2022-07-23 05:56:15,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152834146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:15,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:15,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:56:15,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865916256] [2022-07-23 05:56:15,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:15,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:56:15,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:15,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:56:15,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:56:15,278 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-23 05:56:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:15,376 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2022-07-23 05:56:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:56:15,376 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-23 05:56:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:15,380 INFO L225 Difference]: With dead ends: 87 [2022-07-23 05:56:15,381 INFO L226 Difference]: Without dead ends: 87 [2022-07-23 05:56:15,381 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-23 05:56:15,388 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-23 05:56:15,390 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-23 05:56:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-23 05:56:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2022-07-23 05:56:15,399 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-23 05:56:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-07-23 05:56:15,401 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 10 [2022-07-23 05:56:15,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:15,403 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-07-23 05:56:15,403 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-23 05:56:15,403 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-07-23 05:56:15,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:56:15,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:15,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:56:15,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 05:56:15,404 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-23 05:56:15,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:15,406 INFO L85 PathProgramCache]: Analyzing trace with hash 233083786, now seen corresponding path program 1 times [2022-07-23 05:56:15,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:15,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919141706] [2022-07-23 05:56:15,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:15,509 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-23 05:56:15,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:15,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919141706] [2022-07-23 05:56:15,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919141706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:15,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:15,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:56:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763542215] [2022-07-23 05:56:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:15,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:56:15,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:15,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:56:15,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:56:15,512 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-23 05:56:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:15,588 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2022-07-23 05:56:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:56:15,591 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-23 05:56:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:15,592 INFO L225 Difference]: With dead ends: 90 [2022-07-23 05:56:15,593 INFO L226 Difference]: Without dead ends: 90 [2022-07-23 05:56:15,593 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-23 05:56:15,593 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-23 05:56:15,594 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-23 05:56:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-23 05:56:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2022-07-23 05:56:15,598 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-23 05:56:15,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-07-23 05:56:15,602 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 11 [2022-07-23 05:56:15,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:15,602 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-07-23 05:56:15,603 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-23 05:56:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-07-23 05:56:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 05:56:15,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:15,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:56:15,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 05:56:15,607 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-23 05:56:15,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:15,608 INFO L85 PathProgramCache]: Analyzing trace with hash 683852015, now seen corresponding path program 1 times [2022-07-23 05:56:15,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:15,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309150727] [2022-07-23 05:56:15,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:15,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:15,733 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-23 05:56:15,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:15,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309150727] [2022-07-23 05:56:15,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309150727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:15,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:15,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:56:15,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299433911] [2022-07-23 05:56:15,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:15,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:56:15,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:15,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:56:15,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:56:15,751 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-23 05:56:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:15,801 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-07-23 05:56:15,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:56:15,801 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-23 05:56:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:15,802 INFO L225 Difference]: With dead ends: 66 [2022-07-23 05:56:15,802 INFO L226 Difference]: Without dead ends: 66 [2022-07-23 05:56:15,803 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-23 05:56:15,804 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-23 05:56:15,805 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-23 05:56:15,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-23 05:56:15,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-07-23 05:56:15,808 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-23 05:56:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-07-23 05:56:15,809 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 13 [2022-07-23 05:56:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:15,809 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-07-23 05:56:15,809 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-23 05:56:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-07-23 05:56:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 05:56:15,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:15,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:56:15,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 05:56:15,811 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-23 05:56:15,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:15,811 INFO L85 PathProgramCache]: Analyzing trace with hash -833158411, now seen corresponding path program 1 times [2022-07-23 05:56:15,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:15,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785372779] [2022-07-23 05:56:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:15,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:15,918 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-23 05:56:15,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:15,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785372779] [2022-07-23 05:56:15,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785372779] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:15,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:15,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:56:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414965406] [2022-07-23 05:56:15,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:15,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:56:15,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:15,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:56:15,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:56:15,921 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-23 05:56:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:16,015 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-07-23 05:56:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:56:16,016 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-23 05:56:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:16,016 INFO L225 Difference]: With dead ends: 73 [2022-07-23 05:56:16,017 INFO L226 Difference]: Without dead ends: 73 [2022-07-23 05:56:16,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:56:16,018 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-23 05:56:16,018 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-23 05:56:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-23 05:56:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2022-07-23 05:56:16,021 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-23 05:56:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-07-23 05:56:16,022 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 15 [2022-07-23 05:56:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:16,022 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-07-23 05:56:16,022 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-23 05:56:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-07-23 05:56:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 05:56:16,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:16,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:56:16,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 05:56:16,023 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-23 05:56:16,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash -833147426, now seen corresponding path program 1 times [2022-07-23 05:56:16,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:16,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49024052] [2022-07-23 05:56:16,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:16,056 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-23 05:56:16,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:16,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49024052] [2022-07-23 05:56:16,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49024052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:16,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:16,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:56:16,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424928584] [2022-07-23 05:56:16,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:16,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:56:16,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:16,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:56:16,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:56:16,069 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-23 05:56:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:16,126 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-07-23 05:56:16,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:56:16,127 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-23 05:56:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:16,128 INFO L225 Difference]: With dead ends: 77 [2022-07-23 05:56:16,128 INFO L226 Difference]: Without dead ends: 77 [2022-07-23 05:56:16,128 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-23 05:56:16,129 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.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:16,129 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.0s Time] [2022-07-23 05:56:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-23 05:56:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-07-23 05:56:16,134 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-23 05:56:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-07-23 05:56:16,137 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 15 [2022-07-23 05:56:16,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:16,138 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-07-23 05:56:16,138 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-23 05:56:16,138 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-07-23 05:56:16,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:56:16,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:16,139 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:56:16,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 05:56:16,139 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-23 05:56:16,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:16,141 INFO L85 PathProgramCache]: Analyzing trace with hash 321145941, now seen corresponding path program 1 times [2022-07-23 05:56:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:16,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020483069] [2022-07-23 05:56:16,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:16,229 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-23 05:56:16,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:16,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020483069] [2022-07-23 05:56:16,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020483069] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:16,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395157237] [2022-07-23 05:56:16,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:16,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:16,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:16,232 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-23 05:56:16,233 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-23 05:56:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:16,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 05:56:16,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:16,336 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-23 05:56:16,340 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-23 05:56:16,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:16,367 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-23 05:56:16,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:16,373 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-23 05:56:16,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:16,412 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-23 05:56:16,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:16,431 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-23 05:56:16,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:16,473 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-23 05:56:16,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:16,479 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:16,479 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-23 05:56:16,500 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-23 05:56:16,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:56:22,073 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-23 05:56:22,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:22,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:22,078 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-23 05:56:22,084 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-23 05:56:22,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:22,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:22,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:22,098 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-23 05:56:22,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395157237] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:56:22,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:56:22,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 14 [2022-07-23 05:56:22,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792691601] [2022-07-23 05:56:22,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:56:22,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 05:56:22,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:22,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 05:56:22,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=142, Unknown=4, NotChecked=0, Total=182 [2022-07-23 05:56:22,100 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-23 05:56:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:22,303 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2022-07-23 05:56:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 05:56:22,303 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-23 05:56:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:22,305 INFO L225 Difference]: With dead ends: 85 [2022-07-23 05:56:22,305 INFO L226 Difference]: Without dead ends: 85 [2022-07-23 05:56:22,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=104, Invalid=312, Unknown=4, NotChecked=0, Total=420 [2022-07-23 05:56:22,305 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-23 05:56:22,305 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-23 05:56:22,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-23 05:56:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-07-23 05:56:22,308 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-23 05:56:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2022-07-23 05:56:22,308 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 18 [2022-07-23 05:56:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:22,308 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2022-07-23 05:56:22,308 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-23 05:56:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2022-07-23 05:56:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 05:56:22,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:22,309 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-23 05:56:22,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-23 05:56:22,509 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-23 05:56:22,510 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-23 05:56:22,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1365588675, now seen corresponding path program 1 times [2022-07-23 05:56:22,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:22,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994432311] [2022-07-23 05:56:22,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:22,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:22,562 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-23 05:56:22,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:22,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994432311] [2022-07-23 05:56:22,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994432311] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:22,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802264551] [2022-07-23 05:56:22,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:22,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:22,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:22,564 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-23 05:56:22,565 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-23 05:56:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:22,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 05:56:22,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:22,636 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-23 05:56:22,648 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-23 05:56:22,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:56:22,666 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-23 05:56:22,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802264551] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:56:22,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:56:22,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-23 05:56:22,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912107388] [2022-07-23 05:56:22,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:56:22,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:56:22,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:22,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:56:22,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:56:22,667 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-23 05:56:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:22,729 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-07-23 05:56:22,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:56:22,730 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-23 05:56:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:22,730 INFO L225 Difference]: With dead ends: 83 [2022-07-23 05:56:22,730 INFO L226 Difference]: Without dead ends: 72 [2022-07-23 05:56:22,731 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-23 05:56:22,731 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.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:22,731 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.0s Time] [2022-07-23 05:56:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-23 05:56:22,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-23 05:56:22,733 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-23 05:56:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2022-07-23 05:56:22,733 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 19 [2022-07-23 05:56:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:22,734 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2022-07-23 05:56:22,734 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-23 05:56:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-07-23 05:56:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 05:56:22,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:22,734 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-23 05:56:22,753 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-23 05:56:22,951 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-23 05:56:22,951 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-23 05:56:22,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash -190050214, now seen corresponding path program 1 times [2022-07-23 05:56:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:22,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012658661] [2022-07-23 05:56:22,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:22,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:22,989 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-23 05:56:22,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:22,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012658661] [2022-07-23 05:56:22,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012658661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:22,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:22,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:56:22,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149086227] [2022-07-23 05:56:22,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:22,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:56:22,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:22,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:56:22,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:56:22,991 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-23 05:56:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:23,048 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2022-07-23 05:56:23,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:56:23,049 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-23 05:56:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:23,049 INFO L225 Difference]: With dead ends: 81 [2022-07-23 05:56:23,049 INFO L226 Difference]: Without dead ends: 81 [2022-07-23 05:56:23,050 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-23 05:56:23,050 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:23,050 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.0s Time] [2022-07-23 05:56:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-23 05:56:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2022-07-23 05:56:23,052 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-23 05:56:23,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-07-23 05:56:23,052 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 19 [2022-07-23 05:56:23,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:23,053 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-07-23 05:56:23,053 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-23 05:56:23,053 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-07-23 05:56:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 05:56:23,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:23,053 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-23 05:56:23,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 05:56:23,054 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-23 05:56:23,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:23,054 INFO L85 PathProgramCache]: Analyzing trace with hash -36338646, now seen corresponding path program 1 times [2022-07-23 05:56:23,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:23,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743205016] [2022-07-23 05:56:23,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:23,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:23,123 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-23 05:56:23,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:23,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743205016] [2022-07-23 05:56:23,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743205016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:23,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:23,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:56:23,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824838516] [2022-07-23 05:56:23,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:23,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:56:23,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:23,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:56:23,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:56:23,125 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-23 05:56:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:23,241 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-07-23 05:56:23,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 05:56:23,242 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-23 05:56:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:23,242 INFO L225 Difference]: With dead ends: 87 [2022-07-23 05:56:23,242 INFO L226 Difference]: Without dead ends: 87 [2022-07-23 05:56:23,242 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-23 05:56:23,243 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-23 05:56:23,243 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-23 05:56:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-23 05:56:23,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 68. [2022-07-23 05:56:23,244 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-23 05:56:23,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-23 05:56:23,244 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2022-07-23 05:56:23,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:23,244 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-23 05:56:23,244 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-23 05:56:23,245 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-23 05:56:23,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 05:56:23,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:23,245 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-23 05:56:23,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 05:56:23,245 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-23 05:56:23,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:23,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1126497925, now seen corresponding path program 1 times [2022-07-23 05:56:23,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:23,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647124213] [2022-07-23 05:56:23,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:23,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:23,321 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-23 05:56:23,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:23,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647124213] [2022-07-23 05:56:23,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647124213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:23,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:23,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:56:23,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89301073] [2022-07-23 05:56:23,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:23,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:56:23,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:23,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:56:23,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:56:23,323 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-23 05:56:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:23,452 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-07-23 05:56:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 05:56:23,452 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-23 05:56:23,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:23,453 INFO L225 Difference]: With dead ends: 86 [2022-07-23 05:56:23,453 INFO L226 Difference]: Without dead ends: 86 [2022-07-23 05:56:23,453 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-23 05:56:23,453 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-23 05:56:23,453 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-23 05:56:23,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-23 05:56:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2022-07-23 05:56:23,455 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-23 05:56:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-07-23 05:56:23,455 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 25 [2022-07-23 05:56:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:23,455 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-07-23 05:56:23,455 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-23 05:56:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-07-23 05:56:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 05:56:23,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:23,456 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-23 05:56:23,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 05:56:23,456 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-23 05:56:23,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:23,456 INFO L85 PathProgramCache]: Analyzing trace with hash -561697204, now seen corresponding path program 1 times [2022-07-23 05:56:23,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:23,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550553842] [2022-07-23 05:56:23,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:23,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:23,516 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-23 05:56:23,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:23,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550553842] [2022-07-23 05:56:23,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550553842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:23,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:23,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:56:23,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255004427] [2022-07-23 05:56:23,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:23,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:56:23,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:23,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:56:23,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:56:23,518 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-23 05:56:23,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:23,622 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-07-23 05:56:23,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 05:56:23,623 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-23 05:56:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:23,623 INFO L225 Difference]: With dead ends: 69 [2022-07-23 05:56:23,623 INFO L226 Difference]: Without dead ends: 69 [2022-07-23 05:56:23,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-23 05:56:23,624 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-23 05:56:23,624 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-23 05:56:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-23 05:56:23,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-07-23 05:56:23,625 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-23 05:56:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2022-07-23 05:56:23,625 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 26 [2022-07-23 05:56:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:23,625 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2022-07-23 05:56:23,625 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-23 05:56:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2022-07-23 05:56:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 05:56:23,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:23,626 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-23 05:56:23,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 05:56:23,626 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-23 05:56:23,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:23,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846250, now seen corresponding path program 1 times [2022-07-23 05:56:23,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:23,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502180251] [2022-07-23 05:56:23,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:23,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:23,718 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-23 05:56:23,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:23,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502180251] [2022-07-23 05:56:23,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502180251] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:23,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887275660] [2022-07-23 05:56:23,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:23,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:23,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:23,721 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-23 05:56:23,722 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-23 05:56:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:23,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-23 05:56:23,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:23,800 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-23 05:56:23,811 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:56:23,812 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-23 05:56:23,824 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-23 05:56:23,845 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:56:23,846 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-23 05:56:23,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:23,870 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-23 05:56:23,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:23,917 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:23,917 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-23 05:56:23,933 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-23 05:56:23,935 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-23 05:56:23,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:56:25,963 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:25,964 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 59 treesize of output 63 [2022-07-23 05:56:26,005 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_494 Int) (v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_20| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_494) |v_ULTIMATE.start_main_~list~0#1.offset_20|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_20| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_20|)))) (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (or (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |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_prenex_2) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_1) v_prenex_3))))) is different from false [2022-07-23 05:56:26,015 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:26,015 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-23 05:56:26,039 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-23 05:56:26,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:26,046 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:26,046 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-23 05:56:26,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:26,049 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-23 05:56:26,073 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:26,073 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 1 [2022-07-23 05:56:26,118 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-23 05:56:26,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887275660] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:56:26,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:56:26,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 23 [2022-07-23 05:56:26,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288857321] [2022-07-23 05:56:26,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:56:26,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 05:56:26,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 05:56:26,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=441, Unknown=2, NotChecked=42, Total=552 [2022-07-23 05:56:26,120 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-23 05:56:26,725 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) (forall ((v_ArrVal_494 Int) (v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_20| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_494) |v_ULTIMATE.start_main_~list~0#1.offset_20|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_20| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_20|)))) (= (select |c_#valid| .cse0) 1) (= .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|)) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (or (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |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_prenex_2) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_1) v_prenex_3)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1))) is different from false [2022-07-23 05:56:27,503 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse1 (select .cse3 0)) (.cse0 (select .cse3 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (forall ((v_ArrVal_494 Int) (v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_20| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_494) |v_ULTIMATE.start_main_~list~0#1.offset_20|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_20| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_20|)))) (= (select |c_#valid| .cse2) 1) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0)) (= .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|)) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (or (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |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_prenex_2) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_1) v_prenex_3)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (not (= .cse1 |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select |c_#valid| .cse0) 1)))) is different from false [2022-07-23 05:56:28,073 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (forall ((v_ArrVal_494 Int) (v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_20| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_494) |v_ULTIMATE.start_main_~list~0#1.offset_20|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_20| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_20|)))) (= (select |c_#valid| .cse1) 1) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0)) (= .cse1 |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 (= .cse1 |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (or (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |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_prenex_2) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_1) v_prenex_3)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (= (select |c_#valid| .cse0) 1))) is different from false [2022-07-23 05:56:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:28,279 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-07-23 05:56:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-23 05:56:28,279 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-23 05:56:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:28,279 INFO L225 Difference]: With dead ends: 90 [2022-07-23 05:56:28,279 INFO L226 Difference]: Without dead ends: 90 [2022-07-23 05:56:28,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=276, Invalid=1141, Unknown=5, NotChecked=300, Total=1722 [2022-07-23 05:56:28,281 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 205 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:28,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 150 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 398 Invalid, 0 Unknown, 110 Unchecked, 0.2s Time] [2022-07-23 05:56:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-23 05:56:28,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 73. [2022-07-23 05:56:28,282 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-23 05:56:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-07-23 05:56:28,282 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 26 [2022-07-23 05:56:28,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:28,283 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-07-23 05:56:28,283 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-23 05:56:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-07-23 05:56:28,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 05:56:28,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:28,283 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-23 05:56:28,303 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-23 05:56:28,483 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-23 05:56:28,484 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-23 05:56:28,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:28,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846251, now seen corresponding path program 1 times [2022-07-23 05:56:28,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:28,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417699470] [2022-07-23 05:56:28,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:28,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:28,650 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-23 05:56:28,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:28,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417699470] [2022-07-23 05:56:28,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417699470] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:28,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027355501] [2022-07-23 05:56:28,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:28,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:28,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:28,676 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-23 05:56:28,706 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-23 05:56:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:28,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-23 05:56:28,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:28,792 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-23 05:56:28,796 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-23 05:56:28,835 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:56:28,836 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-23 05:56:28,841 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-23 05:56:28,861 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-23 05:56:28,867 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-23 05:56:28,895 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:56:28,896 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-23 05:56:28,899 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-23 05:56:28,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:28,941 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-23 05:56:28,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:28,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 31 treesize of output 26 [2022-07-23 05:56:28,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:28,999 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-23 05:56:29,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:29,003 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-23 05:56:29,023 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-23 05:56:29,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:56:32,185 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_588 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int)) (v_ArrVal_589 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_24| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_24|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_24| |c_ULTIMATE.start_main_~y~0#1.offset|)) (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_586) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_588) |v_ULTIMATE.start_main_~list~0#1.offset_24|) 4) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_589) |v_ULTIMATE.start_main_~list~0#1.offset_24|)))))) (forall ((v_ArrVal_588 Int) (v_ArrVal_586 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_24| Int)) (or (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_588) |v_ULTIMATE.start_main_~list~0#1.offset_24|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_24|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_24| |c_ULTIMATE.start_main_~y~0#1.offset|))))) is different from false [2022-07-23 05:56:32,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:32,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, 0 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-23 05:56:32,216 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:32,216 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-23 05:56:32,220 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-23 05:56:32,223 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 126 treesize of output 120 [2022-07-23 05:56:32,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:32,235 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:32,236 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-23 05:56:32,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:32,242 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-23 05:56:32,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:32,250 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:32,250 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 82 treesize of output 84 [2022-07-23 05:56:32,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:32,256 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 62 treesize of output 58 [2022-07-23 05:56:32,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:32,298 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-23 05:56:32,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:32,301 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 21 treesize of output 17 [2022-07-23 05:56:32,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:32,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:32,307 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 12 treesize of output 8 [2022-07-23 05:56:34,495 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-23 05:56:34,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027355501] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:56:34,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:56:34,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2022-07-23 05:56:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130170281] [2022-07-23 05:56:34,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:56:34,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 05:56:34,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:34,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 05:56:34,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=438, Unknown=2, NotChecked=42, Total=552 [2022-07-23 05:56:34,498 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-23 05:56:35,405 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|)) (forall ((v_ArrVal_588 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int)) (v_ArrVal_589 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_24| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_24|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_24| |c_ULTIMATE.start_main_~y~0#1.offset|)) (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_586) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_588) |v_ULTIMATE.start_main_~list~0#1.offset_24|) 4) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_589) |v_ULTIMATE.start_main_~list~0#1.offset_24|)))))) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (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|)) (forall ((v_ArrVal_588 Int) (v_ArrVal_586 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_24| Int)) (or (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_588) |v_ULTIMATE.start_main_~list~0#1.offset_24|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_24|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_24| |c_ULTIMATE.start_main_~y~0#1.offset|))))) is different from false [2022-07-23 05:56:36,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:36,124 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2022-07-23 05:56:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 05:56:36,125 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-23 05:56:36,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:36,125 INFO L225 Difference]: With dead ends: 154 [2022-07-23 05:56:36,125 INFO L226 Difference]: Without dead ends: 154 [2022-07-23 05:56:36,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=242, Invalid=1245, Unknown=3, NotChecked=150, Total=1640 [2022-07-23 05:56:36,126 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 99 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:36,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 500 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 685 Invalid, 0 Unknown, 363 Unchecked, 0.3s Time] [2022-07-23 05:56:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-23 05:56:36,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 108. [2022-07-23 05:56:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 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-23 05:56:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2022-07-23 05:56:36,128 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 26 [2022-07-23 05:56:36,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:36,129 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2022-07-23 05:56:36,129 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-23 05:56:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-07-23 05:56:36,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 05:56:36,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:36,129 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-23 05:56:36,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 05:56:36,343 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-23 05:56:36,343 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-23 05:56:36,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:36,344 INFO L85 PathProgramCache]: Analyzing trace with hash 94520065, now seen corresponding path program 1 times [2022-07-23 05:56:36,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:36,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029300228] [2022-07-23 05:56:36,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:36,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:36,490 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-23 05:56:36,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:36,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029300228] [2022-07-23 05:56:36,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029300228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:36,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181872915] [2022-07-23 05:56:36,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:36,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:36,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:36,493 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-23 05:56:36,494 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-23 05:56:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:36,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-23 05:56:36,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:36,575 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-23 05:56:36,597 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:56:36,597 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-23 05:56:36,613 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-23 05:56:36,663 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:36,664 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-23 05:56:36,691 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-23 05:56:36,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:56:36,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181872915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:36,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 05:56:36,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2022-07-23 05:56:36,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263729881] [2022-07-23 05:56:36,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:36,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 05:56:36,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:36,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 05:56:36,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-23 05:56:36,693 INFO L87 Difference]: Start difference. First operand 108 states and 127 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-23 05:56:36,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:36,851 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2022-07-23 05:56:36,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 05:56:36,851 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-23 05:56:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:36,852 INFO L225 Difference]: With dead ends: 117 [2022-07-23 05:56:36,852 INFO L226 Difference]: Without dead ends: 116 [2022-07-23 05:56:36,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2022-07-23 05:56:36,853 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:36,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 143 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:56:36,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-23 05:56:36,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2022-07-23 05:56:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.3125) internal successors, (126), 107 states have internal predecessors, (126), 0 states have call successors, (0), 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-23 05:56:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2022-07-23 05:56:36,854 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 27 [2022-07-23 05:56:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:36,855 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2022-07-23 05:56:36,855 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-23 05:56:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2022-07-23 05:56:36,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 05:56:36,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:36,856 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-23 05:56:36,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-23 05:56:37,067 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-23 05:56:37,067 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-23 05:56:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:37,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1476440114, now seen corresponding path program 1 times [2022-07-23 05:56:37,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:37,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190955127] [2022-07-23 05:56:37,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:37,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:37,151 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-23 05:56:37,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:37,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190955127] [2022-07-23 05:56:37,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190955127] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:37,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907893634] [2022-07-23 05:56:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:37,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:37,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:37,152 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-23 05:56:37,189 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-23 05:56:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:37,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 05:56:37,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:37,295 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-23 05:56:37,310 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:56:37,311 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-23 05:56:37,324 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-23 05:56:37,344 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:56:37,345 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-23 05:56:37,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:37,368 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-23 05:56:37,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:37,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:37,395 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-23 05:56:37,400 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-23 05:56:37,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:56:37,921 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-23 05:56:37,929 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:37,929 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-23 05:56:37,939 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-23 05:56:37,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:37,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:37,946 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-23 05:56:37,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:37,949 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-23 05:56:38,057 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-23 05:56:38,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907893634] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:56:38,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:56:38,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 22 [2022-07-23 05:56:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77804366] [2022-07-23 05:56:38,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:56:38,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-23 05:56:38,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:38,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-23 05:56:38,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=357, Unknown=2, NotChecked=38, Total=462 [2022-07-23 05:56:38,058 INFO L87 Difference]: Start difference. First operand 108 states and 126 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-23 05:56:38,429 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)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1)) is different from false [2022-07-23 05:56:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:38,705 INFO L93 Difference]: Finished difference Result 204 states and 235 transitions. [2022-07-23 05:56:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 05:56:38,705 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-23 05:56:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:38,706 INFO L225 Difference]: With dead ends: 204 [2022-07-23 05:56:38,706 INFO L226 Difference]: Without dead ends: 204 [2022-07-23 05:56:38,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=843, Unknown=3, NotChecked=122, Total=1122 [2022-07-23 05:56:38,707 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 135 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:38,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 286 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 501 Invalid, 0 Unknown, 223 Unchecked, 0.2s Time] [2022-07-23 05:56:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-23 05:56:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 160. [2022-07-23 05:56:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 148 states have (on average 1.2432432432432432) internal successors, (184), 159 states have internal predecessors, (184), 0 states have call successors, (0), 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-23 05:56:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2022-07-23 05:56:38,709 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 27 [2022-07-23 05:56:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:38,709 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2022-07-23 05:56:38,709 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-23 05:56:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2022-07-23 05:56:38,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 05:56:38,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:38,710 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-23 05:56:38,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 05:56:38,919 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-23 05:56:38,919 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-23 05:56:38,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:38,920 INFO L85 PathProgramCache]: Analyzing trace with hash -328711838, now seen corresponding path program 1 times [2022-07-23 05:56:38,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:38,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812802999] [2022-07-23 05:56:38,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:38,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:39,010 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-23 05:56:39,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:39,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812802999] [2022-07-23 05:56:39,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812802999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:39,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:39,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:56:39,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530208146] [2022-07-23 05:56:39,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:39,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:56:39,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:39,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:56:39,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:56:39,012 INFO L87 Difference]: Start difference. First operand 160 states and 184 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-23 05:56:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:39,193 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2022-07-23 05:56:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 05:56:39,194 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-23 05:56:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:39,194 INFO L225 Difference]: With dead ends: 174 [2022-07-23 05:56:39,194 INFO L226 Difference]: Without dead ends: 174 [2022-07-23 05:56:39,195 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-23 05:56:39,195 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:39,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 109 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:56:39,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-23 05:56:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 160. [2022-07-23 05:56:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 148 states have (on average 1.2364864864864864) internal successors, (183), 159 states have internal predecessors, (183), 0 states have call successors, (0), 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-23 05:56:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2022-07-23 05:56:39,199 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 29 [2022-07-23 05:56:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:39,199 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2022-07-23 05:56:39,199 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-23 05:56:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2022-07-23 05:56:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 05:56:39,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:39,200 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-23 05:56:39,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 05:56:39,200 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-23 05:56:39,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:39,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1935506277, now seen corresponding path program 1 times [2022-07-23 05:56:39,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:39,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236901533] [2022-07-23 05:56:39,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:39,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:39,582 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-23 05:56:39,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:39,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236901533] [2022-07-23 05:56:39,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236901533] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:39,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641799932] [2022-07-23 05:56:39,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:39,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:39,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:39,600 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-23 05:56:39,601 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-23 05:56:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:39,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-23 05:56:39,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:39,704 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-23 05:56:39,726 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:56:39,726 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-23 05:56:39,733 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-23 05:56:39,743 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:56:39,744 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-23 05:56:39,763 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-23 05:56:39,764 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-23 05:56:39,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:39,775 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-23 05:56:39,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:39,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:39,958 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-23 05:56:39,959 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-23 05:56:40,035 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:56:40,036 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-23 05:56:40,069 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-23 05:56:40,071 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-23 05:56:40,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:56:57,662 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:57,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 415 treesize of output 465 [2022-07-23 05:56:58,589 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |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_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))))) (and (or .cse0 (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6))) (or (= .cse1 v_prenex_5) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))))) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int)) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_6)) (forall ((v_prenex_4 (Array Int Int))) (let ((.cse2 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6))) (or (= .cse2 v_prenex_5) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (or (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (= |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_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) .cse0) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6) v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse3 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse3 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (v_prenex_4 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse5 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse4 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse5 v_prenex_5) v_prenex_6))) (or (= .cse4 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse5 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse4))))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse6 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6))) (or (= .cse6 v_prenex_5) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |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_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse6) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_6)) (= |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_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_5 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (or (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse7 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse7 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse7 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6) v_prenex_5))))) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int)) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_prenex_4 (Array Int Int))) (let ((.cse8 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5))) (let ((.cse9 (select .cse8 v_prenex_6))) (or (not (= (select .cse8 8) .cse9)) (= .cse9 v_prenex_5))))) (not (<= 0 v_prenex_6)))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int) (v_prenex_4 (Array Int Int))) (let ((.cse10 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse10 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse10 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse11 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6))) (or (= .cse11 v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |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_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse11)))) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6) v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse12 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse12 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse12 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |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_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))))) (= |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_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int) (v_prenex_4 (Array Int Int))) (let ((.cse14 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse13 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse14 v_prenex_5) v_prenex_6))) (or (= .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse13) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))))))) is different from false [2022-07-23 05:56:58,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:58,719 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 71 treesize of output 55 [2022-07-23 05:56:58,722 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 105 treesize of output 97 [2022-07-23 05:56:58,727 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 53 treesize of output 49 [2022-07-23 05:56:58,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:58,743 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:58,743 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 88 treesize of output 104 [2022-07-23 05:56:58,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:58,751 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-23 05:56:58,855 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:58,856 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 71 treesize of output 1 [2022-07-23 05:56:58,861 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:58,861 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 48 treesize of output 1 [2022-07-23 05:56:58,867 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:58,867 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 71 treesize of output 1 [2022-07-23 05:56:58,872 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:58,873 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 71 treesize of output 1 [2022-07-23 05:56:58,878 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:58,878 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 71 treesize of output 1 [2022-07-23 05:56:58,883 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:58,884 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 71 treesize of output 1 [2022-07-23 05:56:58,888 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:58,889 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 1 [2022-07-23 05:56:58,893 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:58,893 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 68 treesize of output 1 [2022-07-23 05:56:58,899 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:58,899 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 71 treesize of output 1 [2022-07-23 05:56:58,904 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:58,904 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 71 treesize of output 1 [2022-07-23 05:56:58,910 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:58,910 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 48 treesize of output 1 [2022-07-23 05:56:58,914 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:58,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, 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-23 05:56:58,919 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:58,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2022-07-23 05:56:58,978 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-23 05:56:58,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641799932] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:56:58,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:56:58,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 37 [2022-07-23 05:56:58,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960924199] [2022-07-23 05:56:58,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:56:58,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-23 05:56:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:58,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-23 05:56:58,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1168, Unknown=7, NotChecked=70, Total=1406 [2022-07-23 05:56:58,980 INFO L87 Difference]: Start difference. First operand 160 states and 183 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-23 05:57:01,076 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |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_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (or .cse0 (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6))) (or (= .cse1 v_prenex_5) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int)) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_6)) (forall ((v_prenex_4 (Array Int Int))) (let ((.cse2 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6))) (or (= .cse2 v_prenex_5) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (or (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (= |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_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) .cse0) (= (select |c_#valid| .cse3) 1) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6) v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse4 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse4 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))))) (= .cse3 |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|)) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (v_prenex_4 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse6 v_prenex_5) v_prenex_6))) (or (= .cse5 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse6 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse5))))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse7 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6))) (or (= .cse7 v_prenex_5) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |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_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse7) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5)))) (not (= .cse3 |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_6)) (= |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_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (forall ((v_prenex_5 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (or (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse8 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6) v_prenex_5))))) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int)) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_prenex_4 (Array Int Int))) (let ((.cse9 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5))) (let ((.cse10 (select .cse9 v_prenex_6))) (or (not (= (select .cse9 8) .cse10)) (= .cse10 v_prenex_5))))) (not (<= 0 v_prenex_6)))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int) (v_prenex_4 (Array Int Int))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse11 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse11 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse12 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6))) (or (= .cse12 v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |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_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse12)))) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6) v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse13 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse13 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |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_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))))) (= |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_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int) (v_prenex_4 (Array Int Int))) (let ((.cse15 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse14 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse15 v_prenex_5) v_prenex_6))) (or (= .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse15 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse14) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))))))) is different from false [2022-07-23 05:57:03,204 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse0 (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |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_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (or .cse0 (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6))) (or (= .cse1 v_prenex_5) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int)) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_6)) (forall ((v_prenex_4 (Array Int Int))) (let ((.cse2 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6))) (or (= .cse2 v_prenex_5) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (not (= (select .cse3 8) .cse4)) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (= |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_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) .cse0) (= (select |c_#valid| .cse5) 1) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse4)) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6) v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse6 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse6 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))))) (= .cse5 |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|)) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (v_prenex_4 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse7 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse8 v_prenex_5) v_prenex_6))) (or (= .cse7 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse7))))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse9 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6))) (or (= .cse9 v_prenex_5) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |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_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse9) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5)))) (not (= .cse5 |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_6)) (= |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_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (forall ((v_prenex_5 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (or (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse10 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse10 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6) v_prenex_5))))) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int)) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_prenex_4 (Array Int Int))) (let ((.cse11 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5))) (let ((.cse12 (select .cse11 v_prenex_6))) (or (not (= (select .cse11 8) .cse12)) (= .cse12 v_prenex_5))))) (not (<= 0 v_prenex_6)))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int) (v_prenex_4 (Array Int Int))) (let ((.cse13 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse13 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse14 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6))) (or (= .cse14 v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |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_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse14)))) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6) v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse15 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse15 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse15 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (= (select |c_#valid| .cse4) 1) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |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_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))))) (= |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_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int) (v_prenex_4 (Array Int Int))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse16 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse17 v_prenex_5) v_prenex_6))) (or (= .cse16 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse17 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse16) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5)))))))) is different from false [2022-07-23 05:57:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:03,388 INFO L93 Difference]: Finished difference Result 168 states and 191 transitions. [2022-07-23 05:57:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 05:57:03,389 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-23 05:57:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:03,389 INFO L225 Difference]: With dead ends: 168 [2022-07-23 05:57:03,389 INFO L226 Difference]: Without dead ends: 168 [2022-07-23 05:57:03,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=315, Invalid=1850, Unknown=9, NotChecked=276, Total=2450 [2022-07-23 05:57:03,390 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 83 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:57:03,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 237 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 327 Invalid, 0 Unknown, 298 Unchecked, 0.1s Time] [2022-07-23 05:57:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-23 05:57:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 163. [2022-07-23 05:57:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.2450331125827814) internal successors, (188), 162 states have internal predecessors, (188), 0 states have call successors, (0), 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-23 05:57:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2022-07-23 05:57:03,393 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 31 [2022-07-23 05:57:03,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:03,393 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2022-07-23 05:57:03,393 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-23 05:57:03,393 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2022-07-23 05:57:03,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 05:57:03,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:03,393 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-23 05:57:03,421 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-23 05:57:03,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:57:03,594 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-23 05:57:03,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:03,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1935506278, now seen corresponding path program 1 times [2022-07-23 05:57:03,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:57:03,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079170515] [2022-07-23 05:57:03,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:03,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:57:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:03,786 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-23 05:57:03,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:57:03,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079170515] [2022-07-23 05:57:03,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079170515] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:57:03,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140879007] [2022-07-23 05:57:03,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:03,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:57:03,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:57:03,790 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-23 05:57:03,791 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-23 05:57:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:03,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-23 05:57:03,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:03,910 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-23 05:57:03,913 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-23 05:57:03,940 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:57:03,940 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-23 05:57:03,949 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:57:03,949 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-23 05:57:03,968 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-23 05:57:03,972 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-23 05:57:04,008 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:57:04,009 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-23 05:57:04,012 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-23 05:57:04,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:57:04,045 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-23 05:57:04,051 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-23 05:57:04,051 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-23 05:57:04,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:57:04,082 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-23 05:57:04,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:57:04,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-23 05:57:04,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:57:04,134 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-23 05:57:04,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:57:04,137 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-23 05:57:04,163 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-23 05:57:04,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:57:11,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:57:11,731 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 87 treesize of output 105 [2022-07-23 05:57:11,822 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_103 Int) (v_prenex_100 Int) (v_prenex_101 (Array Int Int))) (or (not (<= 0 v_prenex_100)) (not (<= v_prenex_100 |c_ULTIMATE.start_main_~y~0#1.offset|)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_101) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_103) v_prenex_100)))) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_36| Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_14| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1008 Int) (v_ArrVal_1007 Int) (v_ArrVal_1009 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_14|) (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_1006) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_1008) |v_ULTIMATE.start_main_~list~0#1.offset_36|) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc8#1.base_14| v_ArrVal_1007) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1005) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_1009) |v_ULTIMATE.start_main_~list~0#1.offset_36|)))) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_36| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_36|))))) is different from false [2022-07-23 05:57:11,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:57:11,835 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-23 05:57:11,838 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-23 05:57:11,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:57:11,845 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:57:11,846 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-23 05:57:11,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:57:11,850 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-23 05:57:11,878 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:57:11,879 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 50 treesize of output 51 [2022-07-23 05:57:11,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:57:11,882 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 48 treesize of output 44 [2022-07-23 05:57:11,886 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:57:11,887 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 37 treesize of output 38 [2022-07-23 05:57:11,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:57:11,890 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 35 treesize of output 31 [2022-07-23 05:57:11,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:57:11,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:57:11,894 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-23 05:57:11,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:57:11,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:57:11,898 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-23 05:57:19,997 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 30 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 05:57:20,110 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-23 05:57:20,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140879007] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:57:20,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:57:20,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 26 [2022-07-23 05:57:20,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454616455] [2022-07-23 05:57:20,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:57:20,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-23 05:57:20,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:57:20,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-23 05:57:20,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=569, Unknown=2, NotChecked=48, Total=702 [2022-07-23 05:57:20,113 INFO L87 Difference]: Start difference. First operand 163 states and 188 transitions. Second operand has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 27 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-23 05:57:22,188 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)) (<= 13 (select |c_#length| |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_prenex_103 Int) (v_prenex_100 Int) (v_prenex_101 (Array Int Int))) (or (not (<= 0 v_prenex_100)) (not (<= v_prenex_100 |c_ULTIMATE.start_main_~y~0#1.offset|)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_101) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_103) v_prenex_100)))) (= |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|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_36| Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_14| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1008 Int) (v_ArrVal_1007 Int) (v_ArrVal_1009 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_14|) (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_1006) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1008) |v_ULTIMATE.start_main_~list~0#1.offset_36|) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc8#1.base_14| v_ArrVal_1007) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1005) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1009) |v_ULTIMATE.start_main_~list~0#1.offset_36|)))) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_36| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_36|)))))) is different from false [2022-07-23 05:57:22,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:22,596 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2022-07-23 05:57:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 05:57:22,596 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 27 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-23 05:57:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:22,597 INFO L225 Difference]: With dead ends: 201 [2022-07-23 05:57:22,597 INFO L226 Difference]: Without dead ends: 201 [2022-07-23 05:57:22,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=174, Invalid=1091, Unknown=3, NotChecked=138, Total=1406 [2022-07-23 05:57:22,598 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 79 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 404 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:57:22,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 364 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 663 Invalid, 0 Unknown, 404 Unchecked, 0.3s Time] [2022-07-23 05:57:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-23 05:57:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 149. [2022-07-23 05:57:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 148 states have internal predecessors, (173), 0 states have call successors, (0), 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-23 05:57:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2022-07-23 05:57:22,600 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 31 [2022-07-23 05:57:22,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:22,600 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2022-07-23 05:57:22,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 27 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-23 05:57:22,600 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2022-07-23 05:57:22,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 05:57:22,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:22,601 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-23 05:57:22,618 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-23 05:57:22,811 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-23 05:57:22,811 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-23 05:57:22,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash 678559033, now seen corresponding path program 1 times [2022-07-23 05:57:22,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:57:22,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485953588] [2022-07-23 05:57:22,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:57:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:23,085 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-23 05:57:23,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:57:23,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485953588] [2022-07-23 05:57:23,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485953588] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:57:23,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414538428] [2022-07-23 05:57:23,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:23,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:57:23,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:57:23,091 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-23 05:57:23,096 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-23 05:57:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:23,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-23 05:57:23,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:23,198 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-23 05:57:23,206 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-23 05:57:23,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-23 05:57:23,244 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:57:23,245 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-23 05:57:23,270 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-23 05:57:23,276 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-23 05:57:23,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:57:23,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:57:23,313 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:57:23,314 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 85 treesize of output 62 [2022-07-23 05:57:23,322 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-23 05:57:23,322 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-23 05:57:23,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:57:23,374 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:57:23,375 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 1 case distinctions, treesize of input 49 treesize of output 53 [2022-07-23 05:57:23,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:57:23,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:57:23,384 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-23 05:57:23,385 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 65 treesize of output 54 [2022-07-23 05:57:23,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:57:23,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:57:23,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:57:23,740 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 05:57:23,740 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 68 treesize of output 40 [2022-07-23 05:57:23,802 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-23 05:57:23,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:01,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:01,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:01,990 INFO L356 Elim1Store]: treesize reduction 22, result has 62.1 percent of original size [2022-07-23 05:58:01,990 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 3 case distinctions, treesize of input 722 treesize of output 625 [2022-07-23 05:58:02,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:02,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:02,070 INFO L356 Elim1Store]: treesize reduction 239, result has 21.4 percent of original size [2022-07-23 05:58:02,071 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 503720 treesize of output 117843 [2022-07-23 05:58:04,149 INFO L356 Elim1Store]: treesize reduction 19, result has 51.3 percent of original size [2022-07-23 05:58:04,150 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 97136 treesize of output 88470 [2022-07-23 05:58:04,468 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:58:04,469 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 88419 treesize of output 81513 [2022-07-23 05:58:04,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:04,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:04,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:04,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:04,759 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 71150 treesize of output 64238 [2022-07-23 05:58:05,086 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