./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.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/list-ext3-properties/dll_nullified-2.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 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:40:11,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:40:11,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:40:11,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:40:11,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:40:11,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:40:11,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:40:11,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:40:11,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:40:11,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:40:11,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:40:11,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:40:11,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:40:11,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:40:11,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:40:11,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:40:11,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:40:11,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:40:11,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:40:11,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:40:11,864 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:40:11,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:40:11,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:40:11,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:40:11,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:40:11,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:40:11,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:40:11,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:40:11,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:40:11,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:40:11,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:40:11,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:40:11,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:40:11,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:40:11,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:40:11,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:40:11,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:40:11,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:40:11,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:40:11,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:40:11,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:40:11,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:40:11,877 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:40:11,900 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:40:11,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:40:11,902 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:40:11,902 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:40:11,903 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:40:11,903 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:40:11,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:40:11,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:40:11,904 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:40:11,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:40:11,905 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:40:11,905 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:40:11,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:40:11,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:40:11,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:40:11,906 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:40:11,906 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:40:11,906 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:40:11,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:40:11,907 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:40:11,907 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:40:11,907 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:40:11,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:40:11,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:40:11,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:40:11,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:40:11,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:40:11,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:40:11,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:40:11,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:40:11,909 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 -> 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 [2022-07-23 06:40:12,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:40:12,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:40:12,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:40:12,116 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:40:12,117 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:40:12,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2022-07-23 06:40:12,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d452de4a0/11fa947548014b3bb7139307f98e4c63/FLAG61a26ab1b [2022-07-23 06:40:12,624 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:40:12,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2022-07-23 06:40:12,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d452de4a0/11fa947548014b3bb7139307f98e4c63/FLAG61a26ab1b [2022-07-23 06:40:12,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d452de4a0/11fa947548014b3bb7139307f98e4c63 [2022-07-23 06:40:12,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:40:12,669 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:40:12,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:40:12,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:40:12,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:40:12,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:40:12" (1/1) ... [2022-07-23 06:40:12,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20dd36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:12, skipping insertion in model container [2022-07-23 06:40:12,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:40:12" (1/1) ... [2022-07-23 06:40:12,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:40:12,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:40:12,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i[23974,23987] [2022-07-23 06:40:12,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:40:12,998 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:40:13,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i[23974,23987] [2022-07-23 06:40:13,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:40:13,063 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:40:13,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:13 WrapperNode [2022-07-23 06:40:13,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:40:13,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:40:13,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:40:13,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:40:13,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:13" (1/1) ... [2022-07-23 06:40:13,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:13" (1/1) ... [2022-07-23 06:40:13,108 INFO L137 Inliner]: procedures = 122, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2022-07-23 06:40:13,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:40:13,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:40:13,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:40:13,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:40:13,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:13" (1/1) ... [2022-07-23 06:40:13,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:13" (1/1) ... [2022-07-23 06:40:13,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:13" (1/1) ... [2022-07-23 06:40:13,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:13" (1/1) ... [2022-07-23 06:40:13,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:13" (1/1) ... [2022-07-23 06:40:13,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:13" (1/1) ... [2022-07-23 06:40:13,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:13" (1/1) ... [2022-07-23 06:40:13,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:40:13,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:40:13,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:40:13,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:40:13,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:13" (1/1) ... [2022-07-23 06:40:13,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:40:13,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:13,188 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 06:40:13,197 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 06:40:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 06:40:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 06:40:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:40:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:40:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:40:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:40:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:40:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 06:40:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:40:13,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:40:13,370 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:40:13,377 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:40:13,607 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:40:13,615 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:40:13,615 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 06:40:13,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:40:13 BoogieIcfgContainer [2022-07-23 06:40:13,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:40:13,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:40:13,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:40:13,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:40:13,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:40:12" (1/3) ... [2022-07-23 06:40:13,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49eefdeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:40:13, skipping insertion in model container [2022-07-23 06:40:13,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:13" (2/3) ... [2022-07-23 06:40:13,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49eefdeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:40:13, skipping insertion in model container [2022-07-23 06:40:13,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:40:13" (3/3) ... [2022-07-23 06:40:13,632 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2022-07-23 06:40:13,642 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:40:13,643 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2022-07-23 06:40:13,686 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:40:13,691 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@5005a13a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34f5f01b [2022-07-23 06:40:13,691 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2022-07-23 06:40:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 49 states have (on average 2.0) internal successors, (98), 84 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 06:40:13,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:13,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 06:40:13,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:13,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:13,703 INFO L85 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2022-07-23 06:40:13,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:13,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976518858] [2022-07-23 06:40:13,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:13,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:13,853 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 06:40:13,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:13,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976518858] [2022-07-23 06:40:13,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976518858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:13,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:13,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:40:13,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994190913] [2022-07-23 06:40:13,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:13,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:40:13,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:13,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:40:13,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:40:13,886 INFO L87 Difference]: Start difference. First operand has 85 states, 49 states have (on average 2.0) internal successors, (98), 84 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 06:40:14,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:14,016 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-07-23 06:40:14,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:40:14,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-23 06:40:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:14,026 INFO L225 Difference]: With dead ends: 141 [2022-07-23 06:40:14,027 INFO L226 Difference]: Without dead ends: 136 [2022-07-23 06:40:14,028 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 06:40:14,031 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 84 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:14,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 164 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:40:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-23 06:40:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 77. [2022-07-23 06:40:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 76 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 06:40:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2022-07-23 06:40:14,057 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 5 [2022-07-23 06:40:14,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:14,057 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2022-07-23 06:40:14,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 06:40:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2022-07-23 06:40:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 06:40:14,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:14,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 06:40:14,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:40:14,059 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:14,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2022-07-23 06:40:14,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:14,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138998837] [2022-07-23 06:40:14,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:14,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:14,093 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 06:40:14,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:14,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138998837] [2022-07-23 06:40:14,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138998837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:14,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:14,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:40:14,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631560609] [2022-07-23 06:40:14,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:14,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:40:14,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:14,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:40:14,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:40:14,096 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 06:40:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:14,171 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2022-07-23 06:40:14,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:40:14,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-23 06:40:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:14,173 INFO L225 Difference]: With dead ends: 131 [2022-07-23 06:40:14,173 INFO L226 Difference]: Without dead ends: 131 [2022-07-23 06:40:14,173 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 06:40:14,174 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 76 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:14,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 165 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:40:14,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-23 06:40:14,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 72. [2022-07-23 06:40:14,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.702127659574468) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 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 06:40:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2022-07-23 06:40:14,182 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 5 [2022-07-23 06:40:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:14,183 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2022-07-23 06:40:14,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 06:40:14,184 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-07-23 06:40:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:40:14,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:14,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:40:14,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:40:14,185 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash 889665583, now seen corresponding path program 1 times [2022-07-23 06:40:14,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:14,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143534046] [2022-07-23 06:40:14,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:14,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:14,201 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 06:40:14,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:14,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143534046] [2022-07-23 06:40:14,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143534046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:14,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:14,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:40:14,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325528693] [2022-07-23 06:40:14,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:14,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:40:14,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:14,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:40:14,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:40:14,204 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 06:40:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:14,210 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-07-23 06:40:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:40:14,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-23 06:40:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:14,211 INFO L225 Difference]: With dead ends: 84 [2022-07-23 06:40:14,211 INFO L226 Difference]: Without dead ends: 84 [2022-07-23 06:40:14,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:40:14,212 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 12 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:14,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 154 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:40:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-23 06:40:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2022-07-23 06:40:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.6875) internal successors, (81), 72 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 06:40:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2022-07-23 06:40:14,217 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 6 [2022-07-23 06:40:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:14,217 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2022-07-23 06:40:14,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 06:40:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2022-07-23 06:40:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 06:40:14,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:14,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:14,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:40:14,219 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:14,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:14,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1228392914, now seen corresponding path program 1 times [2022-07-23 06:40:14,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:14,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12990451] [2022-07-23 06:40:14,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:14,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:14,274 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 06:40:14,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:14,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12990451] [2022-07-23 06:40:14,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12990451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:14,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:14,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:40:14,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134619653] [2022-07-23 06:40:14,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:14,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:40:14,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:14,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:40:14,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:40:14,281 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:14,295 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-07-23 06:40:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:40:14,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 06:40:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:14,297 INFO L225 Difference]: With dead ends: 81 [2022-07-23 06:40:14,297 INFO L226 Difference]: Without dead ends: 81 [2022-07-23 06:40:14,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:40:14,305 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:14,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 149 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:40:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-23 06:40:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-07-23 06:40:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.6) internal successors, (88), 79 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-07-23 06:40:14,319 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 11 [2022-07-23 06:40:14,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:14,319 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-07-23 06:40:14,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-07-23 06:40:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:40:14,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:14,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:14,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:40:14,322 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:14,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:14,323 INFO L85 PathProgramCache]: Analyzing trace with hash -91353250, now seen corresponding path program 1 times [2022-07-23 06:40:14,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:14,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936997288] [2022-07-23 06:40:14,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:14,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:40:14,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:14,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936997288] [2022-07-23 06:40:14,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936997288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:14,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:14,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:40:14,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8106414] [2022-07-23 06:40:14,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:14,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:40:14,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:14,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:40:14,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:40:14,381 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 6 states, 5 states have (on average 3.0) 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 06:40:14,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:14,511 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-07-23 06:40:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:40:14,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) 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 06:40:14,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:14,512 INFO L225 Difference]: With dead ends: 101 [2022-07-23 06:40:14,512 INFO L226 Difference]: Without dead ends: 101 [2022-07-23 06:40:14,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:40:14,515 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 255 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:14,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 93 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:40:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-23 06:40:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2022-07-23 06:40:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 73 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 06:40:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-07-23 06:40:14,524 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 15 [2022-07-23 06:40:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:14,526 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-07-23 06:40:14,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) 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 06:40:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-07-23 06:40:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:40:14,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:14,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:14,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:40:14,528 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:14,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash -91353249, now seen corresponding path program 1 times [2022-07-23 06:40:14,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:14,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049720053] [2022-07-23 06:40:14,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:14,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:14,635 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 06:40:14,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:14,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049720053] [2022-07-23 06:40:14,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049720053] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:14,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930426088] [2022-07-23 06:40:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:14,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:14,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:14,638 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 06:40:14,668 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 06:40:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:14,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:40:14,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:14,782 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 06:40:14,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:14,808 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 06:40:14,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930426088] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:14,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:14,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-23 06:40:14,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872763930] [2022-07-23 06:40:14,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:14,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:40:14,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:14,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:40:14,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:40:14,810 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 06:40:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:14,829 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2022-07-23 06:40:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:40:14,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 15 [2022-07-23 06:40:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:14,829 INFO L225 Difference]: With dead ends: 98 [2022-07-23 06:40:14,830 INFO L226 Difference]: Without dead ends: 98 [2022-07-23 06:40:14,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:40:14,831 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 44 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:14,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 213 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:40:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-23 06:40:14,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-07-23 06:40:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.3875) internal successors, (111), 95 states have internal predecessors, (111), 0 states have call successors, (0), 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 06:40:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2022-07-23 06:40:14,841 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 15 [2022-07-23 06:40:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:14,841 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2022-07-23 06:40:14,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 06:40:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-07-23 06:40:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 06:40:14,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:14,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:14,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 06:40:15,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-23 06:40:15,057 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:15,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:15,059 INFO L85 PathProgramCache]: Analyzing trace with hash 965941252, now seen corresponding path program 1 times [2022-07-23 06:40:15,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:15,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874454602] [2022-07-23 06:40:15,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:15,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:40:15,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:15,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874454602] [2022-07-23 06:40:15,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874454602] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:15,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214562910] [2022-07-23 06:40:15,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:15,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:15,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:15,209 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 06:40:15,210 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 06:40:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:15,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 06:40:15,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:15,313 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 06:40:15,317 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 06:40:15,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:15,377 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 06:40:15,384 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:40:15,385 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 06:40:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:40:15,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:40:15,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214562910] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:15,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:15,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2022-07-23 06:40:15,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548993996] [2022-07-23 06:40:15,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:15,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:40:15,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:15,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:40:15,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:40:15,726 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 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 06:40:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:15,866 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2022-07-23 06:40:15,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:40:15,866 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 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 20 [2022-07-23 06:40:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:15,867 INFO L225 Difference]: With dead ends: 120 [2022-07-23 06:40:15,867 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 06:40:15,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:40:15,868 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 401 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:15,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 77 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2022-07-23 06:40:15,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 06:40:15,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 95. [2022-07-23 06:40:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.35) internal successors, (108), 94 states have internal predecessors, (108), 0 states have call successors, (0), 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 06:40:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-07-23 06:40:15,872 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 20 [2022-07-23 06:40:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:15,872 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-07-23 06:40:15,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 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 06:40:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-07-23 06:40:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 06:40:15,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:15,873 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:15,900 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 06:40:16,091 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,SelfDestructingSolverStorable6 [2022-07-23 06:40:16,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash -671675920, now seen corresponding path program 2 times [2022-07-23 06:40:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:16,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468577736] [2022-07-23 06:40:16,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:16,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:16,151 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-23 06:40:16,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:16,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468577736] [2022-07-23 06:40:16,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468577736] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:16,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393009274] [2022-07-23 06:40:16,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:40:16,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:16,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:16,172 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 06:40:16,173 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 06:40:16,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:40:16,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:40:16,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:40:16,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:40:16,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:40:16,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393009274] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:16,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:16,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2022-07-23 06:40:16,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729171593] [2022-07-23 06:40:16,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:16,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:40:16,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:16,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:40:16,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:40:16,430 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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 06:40:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:16,546 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-07-23 06:40:16,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:40:16,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-23 06:40:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:16,547 INFO L225 Difference]: With dead ends: 105 [2022-07-23 06:40:16,548 INFO L226 Difference]: Without dead ends: 105 [2022-07-23 06:40:16,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:40:16,549 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 172 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:16,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 285 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:40:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-23 06:40:16,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-23 06:40:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 104 states have internal predecessors, (115), 0 states have call successors, (0), 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 06:40:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2022-07-23 06:40:16,552 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 42 [2022-07-23 06:40:16,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:16,552 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2022-07-23 06:40:16,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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 06:40:16,553 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2022-07-23 06:40:16,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-23 06:40:16,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:16,554 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:16,581 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 06:40:16,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:16,775 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:16,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:16,775 INFO L85 PathProgramCache]: Analyzing trace with hash -719682373, now seen corresponding path program 1 times [2022-07-23 06:40:16,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:16,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010739766] [2022-07-23 06:40:16,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:16,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-23 06:40:16,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:16,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010739766] [2022-07-23 06:40:16,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010739766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:16,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:16,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:40:16,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734377226] [2022-07-23 06:40:16,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:16,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:40:16,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:16,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:40:16,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:40:16,870 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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 06:40:16,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:16,986 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2022-07-23 06:40:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:40:16,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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 55 [2022-07-23 06:40:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:16,987 INFO L225 Difference]: With dead ends: 140 [2022-07-23 06:40:16,987 INFO L226 Difference]: Without dead ends: 140 [2022-07-23 06:40:16,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:40:16,988 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 341 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:16,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 65 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:40:16,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-23 06:40:16,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 131. [2022-07-23 06:40:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 130 states have internal predecessors, (148), 0 states have call successors, (0), 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 06:40:16,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2022-07-23 06:40:16,990 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 55 [2022-07-23 06:40:16,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:16,991 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2022-07-23 06:40:16,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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 06:40:16,991 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2022-07-23 06:40:16,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-23 06:40:16,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:16,992 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:16,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 06:40:16,992 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:16,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:16,993 INFO L85 PathProgramCache]: Analyzing trace with hash 109308747, now seen corresponding path program 1 times [2022-07-23 06:40:16,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:16,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256363215] [2022-07-23 06:40:16,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:16,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-23 06:40:17,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:17,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256363215] [2022-07-23 06:40:17,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256363215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:17,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:17,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:40:17,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651855322] [2022-07-23 06:40:17,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:17,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:40:17,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:17,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:40:17,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:40:17,081 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 06:40:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:17,155 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2022-07-23 06:40:17,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:40:17,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 59 [2022-07-23 06:40:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:17,156 INFO L225 Difference]: With dead ends: 137 [2022-07-23 06:40:17,156 INFO L226 Difference]: Without dead ends: 137 [2022-07-23 06:40:17,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:40:17,157 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 328 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:17,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 88 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:40:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-23 06:40:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2022-07-23 06:40:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 116 states have (on average 1.2672413793103448) internal successors, (147), 130 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2022-07-23 06:40:17,162 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 59 [2022-07-23 06:40:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:17,163 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2022-07-23 06:40:17,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 06:40:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2022-07-23 06:40:17,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-23 06:40:17,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:17,165 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:17,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 06:40:17,166 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:17,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:17,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1929263777, now seen corresponding path program 1 times [2022-07-23 06:40:17,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:17,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324394633] [2022-07-23 06:40:17,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:17,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-23 06:40:17,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:17,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324394633] [2022-07-23 06:40:17,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324394633] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:17,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693431260] [2022-07-23 06:40:17,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:17,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:17,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:17,313 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 06:40:17,314 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 06:40:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:17,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-23 06:40:17,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:17,477 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 06:40:17,495 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:40:17,496 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 06:40:17,512 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 06:40:17,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:17,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:40:17,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:17,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:40:17,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:17,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:40:17,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:17,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:40:17,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:40:17,655 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 15 treesize of output 7 [2022-07-23 06:40:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-23 06:40:17,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:17,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1269) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-23 06:40:17,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1267 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1267)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1269) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-23 06:40:17,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1264 Int) (v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1267 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1264) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1267)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1269) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-23 06:40:17,721 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 Int) (v_ArrVal_1264 Int) (v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1267 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1262) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1264) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1267)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1269) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-23 06:40:17,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1260 Int) (v_ArrVal_1262 Int) (v_ArrVal_1264 Int) (v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1267 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1260) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1262) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1264) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1267)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1269) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-23 06:40:17,783 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-23 06:40:17,783 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 5 case distinctions, treesize of input 38 treesize of output 59 [2022-07-23 06:40:17,787 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 30 treesize of output 22 [2022-07-23 06:40:17,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:40:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 6 not checked. [2022-07-23 06:40:17,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693431260] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:17,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:17,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 16] total 25 [2022-07-23 06:40:17,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865702496] [2022-07-23 06:40:17,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:17,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-23 06:40:17,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:17,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 06:40:17,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=334, Unknown=5, NotChecked=200, Total=600 [2022-07-23 06:40:17,821 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand has 25 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 0 states have call successors, (0), 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 06:40:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:18,289 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2022-07-23 06:40:18,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 06:40:18,290 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 0 states have call successors, (0), 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 63 [2022-07-23 06:40:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:18,291 INFO L225 Difference]: With dead ends: 162 [2022-07-23 06:40:18,291 INFO L226 Difference]: Without dead ends: 162 [2022-07-23 06:40:18,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=927, Unknown=5, NotChecked=350, Total=1560 [2022-07-23 06:40:18,292 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 648 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 377 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:18,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 394 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 377 Invalid, 0 Unknown, 377 Unchecked, 0.2s Time] [2022-07-23 06:40:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-23 06:40:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 131. [2022-07-23 06:40:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 130 states have internal predecessors, (146), 0 states have call successors, (0), 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 06:40:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2022-07-23 06:40:18,294 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 63 [2022-07-23 06:40:18,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:18,294 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2022-07-23 06:40:18,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 0 states have call successors, (0), 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 06:40:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2022-07-23 06:40:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-23 06:40:18,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:18,295 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:18,316 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 06:40:18,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:18,507 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:18,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1264795644, now seen corresponding path program 1 times [2022-07-23 06:40:18,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:18,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707262361] [2022-07-23 06:40:18,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:18,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 06:40:18,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:18,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707262361] [2022-07-23 06:40:18,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707262361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:18,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385843025] [2022-07-23 06:40:18,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:18,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:18,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:18,708 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 06:40:18,765 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 06:40:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:18,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-23 06:40:18,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:18,927 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 06:40:18,941 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:40:18,941 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 06:40:18,955 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 13 treesize of output 9 [2022-07-23 06:40:18,976 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 06:40:18,977 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:18,991 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 06:40:18,992 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:19,002 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 06:40:19,002 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:19,015 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 16 treesize of output 18 [2022-07-23 06:40:19,065 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 19 treesize of output 7 [2022-07-23 06:40:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-23 06:40:19,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:19,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1648) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2022-07-23 06:40:19,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1647)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1648) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2022-07-23 06:40:19,146 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1645 Int) (v_ArrVal_1647 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1645) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1647)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1648) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2022-07-23 06:40:19,154 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1643 Int) (v_ArrVal_1645 Int) (v_ArrVal_1647 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1643) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1645) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1647)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1648) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2022-07-23 06:40:19,189 INFO L356 Elim1Store]: treesize reduction 191, result has 17.7 percent of original size [2022-07-23 06:40:19,190 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 4 case distinctions, treesize of input 37 treesize of output 53 [2022-07-23 06:40:19,192 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 36 treesize of output 24 [2022-07-23 06:40:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 5 not checked. [2022-07-23 06:40:19,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385843025] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:19,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:19,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 26 [2022-07-23 06:40:19,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602668946] [2022-07-23 06:40:19,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:19,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 06:40:19,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:19,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 06:40:19,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=408, Unknown=4, NotChecked=172, Total=650 [2022-07-23 06:40:19,248 INFO L87 Difference]: Start difference. First operand 131 states and 146 transitions. Second operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 0 states have call successors, (0), 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 06:40:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:19,643 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2022-07-23 06:40:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 06:40:19,643 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 0 states have call successors, (0), 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 65 [2022-07-23 06:40:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:19,644 INFO L225 Difference]: With dead ends: 162 [2022-07-23 06:40:19,644 INFO L226 Difference]: Without dead ends: 162 [2022-07-23 06:40:19,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=975, Unknown=4, NotChecked=284, Total=1560 [2022-07-23 06:40:19,645 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 783 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 540 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:19,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 469 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 434 Invalid, 0 Unknown, 540 Unchecked, 0.2s Time] [2022-07-23 06:40:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-23 06:40:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 131. [2022-07-23 06:40:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 116 states have (on average 1.25) internal successors, (145), 130 states have internal predecessors, (145), 0 states have call successors, (0), 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 06:40:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2022-07-23 06:40:19,648 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 65 [2022-07-23 06:40:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:19,648 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2022-07-23 06:40:19,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 0 states have call successors, (0), 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 06:40:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2022-07-23 06:40:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-23 06:40:19,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:19,649 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:19,685 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 06:40:19,868 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,SelfDestructingSolverStorable11 [2022-07-23 06:40:19,868 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:19,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash -892543400, now seen corresponding path program 1 times [2022-07-23 06:40:19,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:19,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715354581] [2022-07-23 06:40:19,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:19,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-23 06:40:20,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:20,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715354581] [2022-07-23 06:40:20,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715354581] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:20,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239187314] [2022-07-23 06:40:20,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:20,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:20,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:20,001 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 06:40:20,004 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 06:40:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:20,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 06:40:20,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:20,205 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 06:40:20,248 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:40:20,248 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 06:40:20,280 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 13 treesize of output 9 [2022-07-23 06:40:20,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:20,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:20,320 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:20,320 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 33 treesize of output 34 [2022-07-23 06:40:20,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:20,392 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 26 treesize of output 22 [2022-07-23 06:40:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-23 06:40:20,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:22,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:22,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:22,010 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 2 case distinctions, treesize of input 26 treesize of output 32 [2022-07-23 06:40:22,016 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:22,017 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 35 treesize of output 35 [2022-07-23 06:40:22,019 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 06:40:22,030 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-23 06:40:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-23 06:40:22,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239187314] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:22,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:22,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2022-07-23 06:40:22,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688555881] [2022-07-23 06:40:22,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:22,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-23 06:40:22,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:22,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-23 06:40:22,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=901, Unknown=6, NotChecked=0, Total=992 [2022-07-23 06:40:22,180 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 0 states have call successors, (0), 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 06:40:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:22,790 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2022-07-23 06:40:22,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 06:40:22,791 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 0 states have call successors, (0), 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 66 [2022-07-23 06:40:22,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:22,791 INFO L225 Difference]: With dead ends: 149 [2022-07-23 06:40:22,791 INFO L226 Difference]: Without dead ends: 145 [2022-07-23 06:40:22,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=335, Invalid=1915, Unknown=6, NotChecked=0, Total=2256 [2022-07-23 06:40:22,793 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 510 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:22,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 824 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 619 Invalid, 0 Unknown, 210 Unchecked, 0.3s Time] [2022-07-23 06:40:22,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-23 06:40:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 117. [2022-07-23 06:40:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 116 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 06:40:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2022-07-23 06:40:22,795 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 66 [2022-07-23 06:40:22,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:22,795 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2022-07-23 06:40:22,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 0 states have call successors, (0), 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 06:40:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2022-07-23 06:40:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-23 06:40:22,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:22,795 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:22,820 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 06:40:23,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:23,003 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:23,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:23,004 INFO L85 PathProgramCache]: Analyzing trace with hash 8707913, now seen corresponding path program 1 times [2022-07-23 06:40:23,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:23,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006274545] [2022-07-23 06:40:23,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:23,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 06:40:23,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:23,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006274545] [2022-07-23 06:40:23,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006274545] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:23,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102399133] [2022-07-23 06:40:23,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:23,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:23,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:23,174 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 06:40:23,175 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 06:40:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:23,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 06:40:23,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:23,415 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 06:40:23,429 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:40:23,429 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 06:40:23,448 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 13 treesize of output 9 [2022-07-23 06:40:23,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:23,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:23,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:23,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:23,484 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 16 treesize of output 18 [2022-07-23 06:40:23,596 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 15 treesize of output 7 [2022-07-23 06:40:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-23 06:40:23,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:23,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2402 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_35| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_35|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2402) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_35| 16)) 0) (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_35|)))) is different from false [2022-07-23 06:40:23,752 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2402 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_35| Int) (v_ArrVal_2400 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_35|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2400)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2402) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_35| 16)) 0) (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_35|)))) is different from false [2022-07-23 06:40:23,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2402 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_35| Int) (v_ArrVal_2398 Int) (v_ArrVal_2400 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_35|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_2398) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2400)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2402) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_35| 16)) 0) (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_35|)))) is different from false [2022-07-23 06:40:23,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:23,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:23,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:23,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:23,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 43 [2022-07-23 06:40:23,780 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:23,780 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 36 treesize of output 36 [2022-07-23 06:40:23,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:40:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 4 not checked. [2022-07-23 06:40:23,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102399133] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:23,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:23,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 30 [2022-07-23 06:40:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672840489] [2022-07-23 06:40:23,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:23,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-23 06:40:23,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:23,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-23 06:40:23,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=621, Unknown=3, NotChecked=156, Total=870 [2022-07-23 06:40:23,869 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 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 06:40:24,402 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (forall ((v_ArrVal_2402 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_35| Int) (v_ArrVal_2398 Int) (v_ArrVal_2400 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_35|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_2398) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2400)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2402) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_35| 16)) 0) (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_35|)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 16) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2022-07-23 06:40:24,744 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_2402 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_35| Int) (v_ArrVal_2400 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_35|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2400)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2402) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_35| 16)) 0) (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_35|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2022-07-23 06:40:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:24,967 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2022-07-23 06:40:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 06:40:24,968 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 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 67 [2022-07-23 06:40:24,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:24,968 INFO L225 Difference]: With dead ends: 142 [2022-07-23 06:40:24,968 INFO L226 Difference]: Without dead ends: 142 [2022-07-23 06:40:24,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=314, Invalid=1183, Unknown=5, NotChecked=390, Total=1892 [2022-07-23 06:40:24,969 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 595 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 405 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:24,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 386 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 248 Invalid, 0 Unknown, 405 Unchecked, 0.1s Time] [2022-07-23 06:40:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-23 06:40:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 117. [2022-07-23 06:40:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 116 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 06:40:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2022-07-23 06:40:24,971 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 67 [2022-07-23 06:40:24,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:24,971 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2022-07-23 06:40:24,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 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 06:40:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2022-07-23 06:40:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-23 06:40:24,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:24,972 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:25,007 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 06:40:25,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:25,179 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:25,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:25,180 INFO L85 PathProgramCache]: Analyzing trace with hash -221625277, now seen corresponding path program 1 times [2022-07-23 06:40:25,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:25,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677243609] [2022-07-23 06:40:25,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:25,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 50 proven. 33 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 06:40:25,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:25,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677243609] [2022-07-23 06:40:25,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677243609] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:25,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652396975] [2022-07-23 06:40:25,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:25,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:25,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:25,368 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 06:40:25,419 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 06:40:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:25,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-23 06:40:25,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:25,668 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 06:40:25,682 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:40:25,682 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 06:40:25,709 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 13 treesize of output 9 [2022-07-23 06:40:25,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:25,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:25,746 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:25,746 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 34 treesize of output 35 [2022-07-23 06:40:25,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:25,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:25,955 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 31 treesize of output 16 [2022-07-23 06:40:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-23 06:40:25,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:26,136 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-07-23 06:40:26,137 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 21 treesize of output 20 [2022-07-23 06:40:26,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~head~1#1.offset_37| Int) (v_ArrVal_2779 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_37|) (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_37|)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2779) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_37| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2022-07-23 06:40:26,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~head~1#1.offset_37| Int) (v_ArrVal_2779 (Array Int Int)) (v_ArrVal_2776 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_37|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2776)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2779) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_37| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_37|)))) is different from false [2022-07-23 06:40:26,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:26,164 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:26,164 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 2 case distinctions, treesize of input 27 treesize of output 33 [2022-07-23 06:40:26,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:26,170 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 36 treesize of output 36 [2022-07-23 06:40:26,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:40:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2022-07-23 06:40:26,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652396975] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:26,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:26,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 29 [2022-07-23 06:40:26,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935185641] [2022-07-23 06:40:26,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:26,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-23 06:40:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:26,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-23 06:40:26,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=677, Unknown=2, NotChecked=106, Total=870 [2022-07-23 06:40:26,259 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 30 states, 29 states have (on average 4.241379310344827) internal successors, (123), 30 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:26,716 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~head~1#1.offset_37| Int) (v_ArrVal_2779 (Array Int Int)) (v_ArrVal_2776 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_37|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2776)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2779) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_37| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_37|)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2022-07-23 06:40:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:26,939 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2022-07-23 06:40:26,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:40:26,940 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.241379310344827) internal successors, (123), 30 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-07-23 06:40:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:26,940 INFO L225 Difference]: With dead ends: 124 [2022-07-23 06:40:26,940 INFO L226 Difference]: Without dead ends: 124 [2022-07-23 06:40:26,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=1050, Unknown=3, NotChecked=204, Total=1406 [2022-07-23 06:40:26,941 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 88 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:26,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 556 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 422 Invalid, 0 Unknown, 343 Unchecked, 0.2s Time] [2022-07-23 06:40:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-23 06:40:26,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2022-07-23 06:40:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2022-07-23 06:40:26,943 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 69 [2022-07-23 06:40:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:26,943 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2022-07-23 06:40:26,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.241379310344827) internal successors, (123), 30 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2022-07-23 06:40:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-23 06:40:26,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:26,944 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:26,977 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 06:40:27,155 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,SelfDestructingSolverStorable14 [2022-07-23 06:40:27,156 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:27,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:27,156 INFO L85 PathProgramCache]: Analyzing trace with hash -221625276, now seen corresponding path program 1 times [2022-07-23 06:40:27,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:27,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243106689] [2022-07-23 06:40:27,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:27,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 06:40:27,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:27,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243106689] [2022-07-23 06:40:27,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243106689] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:27,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463862073] [2022-07-23 06:40:27,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:27,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:27,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:27,406 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 06:40:27,406 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 06:40:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:27,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-23 06:40:27,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:27,664 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 06:40:27,715 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:40:27,715 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 06:40:27,743 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 13 treesize of output 9 [2022-07-23 06:40:27,749 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 13 treesize of output 9 [2022-07-23 06:40:27,778 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 06:40:27,779 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:27,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:27,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:27,804 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:27,805 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 54 treesize of output 53 [2022-07-23 06:40:27,807 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 41 treesize of output 41 [2022-07-23 06:40:27,966 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 39 treesize of output 21 [2022-07-23 06:40:27,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-23 06:40:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-23 06:40:28,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:28,191 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:28,191 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 49 treesize of output 53 [2022-07-23 06:40:28,211 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3159 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3159) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_3158 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3158) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 4)))) is different from false [2022-07-23 06:40:28,235 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array Int Int)) (v_ArrVal_3154 Int)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3154)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 4))) (forall ((v_ArrVal_3159 (Array Int Int)) (v_ArrVal_3156 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3156)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3159) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_3158 (Array Int Int)) (v_ArrVal_3154 Int)) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3154)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3158) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)))) is different from false [2022-07-23 06:40:28,247 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:40:28,247 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 2 case distinctions, treesize of input 29 treesize of output 35 [2022-07-23 06:40:28,249 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 28 [2022-07-23 06:40:28,251 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 5 [2022-07-23 06:40:28,255 INFO L356 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2022-07-23 06:40:28,255 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 2 case distinctions, treesize of input 27 treesize of output 1 [2022-07-23 06:40:28,263 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:40:28,263 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 2 case distinctions, treesize of input 29 treesize of output 35 [2022-07-23 06:40:28,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:28,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-23 06:40:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2022-07-23 06:40:28,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463862073] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:28,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:28,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 35 [2022-07-23 06:40:28,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467816168] [2022-07-23 06:40:28,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:28,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-23 06:40:28,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:28,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-23 06:40:28,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1022, Unknown=2, NotChecked=130, Total=1260 [2022-07-23 06:40:28,397 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 36 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 36 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:29,802 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2022-07-23 06:40:29,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 06:40:29,803 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 36 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-07-23 06:40:29,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:29,805 INFO L225 Difference]: With dead ends: 178 [2022-07-23 06:40:29,806 INFO L226 Difference]: Without dead ends: 178 [2022-07-23 06:40:29,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=474, Invalid=2183, Unknown=3, NotChecked=202, Total=2862 [2022-07-23 06:40:29,809 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1632 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:29,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 499 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 818 Invalid, 0 Unknown, 288 Unchecked, 0.4s Time] [2022-07-23 06:40:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-23 06:40:29,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 141. [2022-07-23 06:40:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 127 states have (on average 1.236220472440945) internal successors, (157), 140 states have internal predecessors, (157), 0 states have call successors, (0), 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 06:40:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 157 transitions. [2022-07-23 06:40:29,817 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 157 transitions. Word has length 69 [2022-07-23 06:40:29,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:29,817 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 157 transitions. [2022-07-23 06:40:29,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 36 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:29,818 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 157 transitions. [2022-07-23 06:40:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-23 06:40:29,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:29,818 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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 06:40:29,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-23 06:40:30,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-23 06:40:30,037 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:30,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1069989460, now seen corresponding path program 1 times [2022-07-23 06:40:30,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:30,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580633053] [2022-07-23 06:40:30,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:30,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-23 06:40:30,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:30,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580633053] [2022-07-23 06:40:30,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580633053] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:30,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356467386] [2022-07-23 06:40:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:30,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:30,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:30,144 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:40:30,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-23 06:40:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:30,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 06:40:30,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:30,446 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 31 treesize of output 19 [2022-07-23 06:40:30,448 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 25 treesize of output 13 [2022-07-23 06:40:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-23 06:40:30,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-23 06:40:30,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356467386] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:30,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:30,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 10 [2022-07-23 06:40:30,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994847469] [2022-07-23 06:40:30,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:30,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:40:30,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:30,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:40:30,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:40:30,530 INFO L87 Difference]: Start difference. First operand 141 states and 157 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 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 06:40:30,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:30,648 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2022-07-23 06:40:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:40:30,649 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 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 73 [2022-07-23 06:40:30,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:30,650 INFO L225 Difference]: With dead ends: 144 [2022-07-23 06:40:30,650 INFO L226 Difference]: Without dead ends: 144 [2022-07-23 06:40:30,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:40:30,650 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 137 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:30,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 115 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:40:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-23 06:40:30,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-07-23 06:40:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 127 states have (on average 1.220472440944882) internal successors, (155), 140 states have internal predecessors, (155), 0 states have call successors, (0), 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 06:40:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2022-07-23 06:40:30,653 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 73 [2022-07-23 06:40:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:30,654 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2022-07-23 06:40:30,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 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 06:40:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2022-07-23 06:40:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-23 06:40:30,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:30,654 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:30,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-23 06:40:30,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-23 06:40:30,868 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:30,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:30,868 INFO L85 PathProgramCache]: Analyzing trace with hash -215880728, now seen corresponding path program 1 times [2022-07-23 06:40:30,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:30,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750650091] [2022-07-23 06:40:30,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:30,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 67 proven. 37 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 06:40:31,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:31,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750650091] [2022-07-23 06:40:31,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750650091] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:31,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227126227] [2022-07-23 06:40:31,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:31,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:31,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:31,249 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:40:31,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-23 06:40:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:31,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-23 06:40:31,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:31,523 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 06:40:31,534 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:40:31,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:40:31,557 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 06:40:31,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:31,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:40:31,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:31,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:31,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:31,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-23 06:40:31,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:31,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:31,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:31,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-23 06:40:31,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:31,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:31,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:31,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-23 06:40:31,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-23 06:40:31,749 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 06:40:31,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:40:31,783 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 21 [2022-07-23 06:40:31,792 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 21 [2022-07-23 06:40:31,800 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 21 [2022-07-23 06:40:31,809 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 13 treesize of output 9 [2022-07-23 06:40:31,813 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 21 [2022-07-23 06:40:31,819 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 13 treesize of output 9 [2022-07-23 06:40:31,848 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 21 [2022-07-23 06:40:31,858 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 06:40:31,858 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:31,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:31,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:31,883 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:31,883 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 92 treesize of output 85 [2022-07-23 06:40:31,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:31,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:31,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-07-23 06:40:31,890 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 22 treesize of output 24 [2022-07-23 06:40:32,069 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 46 treesize of output 22 [2022-07-23 06:40:32,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, 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 7 [2022-07-23 06:40:32,132 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:32,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-07-23 06:40:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 73 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-23 06:40:32,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:32,276 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3929 Int) (v_ArrVal_3925 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3929)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3927) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3925) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) 0)) is different from false [2022-07-23 06:40:32,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3922 Int) (v_ArrVal_3921 Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3929 Int) (v_ArrVal_3925 (Array Int Int))) (= (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3920))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3929))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_3922)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3927) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_3921)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3925) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) 0)) is different from false [2022-07-23 06:40:32,311 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:40:32,312 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 2 case distinctions, treesize of input 71 treesize of output 77 [2022-07-23 06:40:32,314 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 124 treesize of output 112 [2022-07-23 06:40:32,317 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 55 treesize of output 51 [2022-07-23 06:40:32,328 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:40:32,328 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 2 case distinctions, treesize of input 96 treesize of output 86 [2022-07-23 06:40:32,330 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 136 treesize of output 118 [2022-07-23 06:40:32,332 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 109 treesize of output 101 [2022-07-23 06:40:32,392 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse3 (not .cse0))) (and (or .cse0 (forall ((v_ArrVal_3920 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3920) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))) (or (forall ((v_arrayElimCell_95 Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3929 Int) (v_arrayElimCell_97 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3920))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3929))) (or (= (select (select (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2) v_arrayElimCell_95) v_arrayElimCell_97) 0) (= (select .cse2 v_arrayElimCell_97) 0))))) .cse3) (forall ((v_arrayElimCell_95 Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3929 Int) (v_arrayElimCell_97 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3920))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse5 (store .cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3929))) (or (= (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse5) v_arrayElimCell_95) v_arrayElimCell_97) 0) (= 0 (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)) (= (select .cse5 v_arrayElimCell_97) 0)))))) (or (forall ((v_arrayElimCell_95 Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3929 Int) (v_arrayElimCell_97 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3920))) (let ((.cse8 (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3929))) (let ((.cse7 (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse8) v_arrayElimCell_95))) (or (= (select .cse7 v_arrayElimCell_97) 0) (= (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= (select .cse8 v_arrayElimCell_97) 0)))))) .cse3) (or (and (forall ((v_arrayElimCell_95 Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3929 Int) (v_arrayElimCell_97 Int)) (let ((.cse10 (select (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3920))) (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3929))) v_arrayElimCell_95))) (or (= (select .cse10 v_arrayElimCell_97) 0) (= (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0)))) (forall ((v_arrayElimCell_95 Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3929 Int) (v_arrayElimCell_97 Int)) (= (select (select (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3920))) (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3929))) v_arrayElimCell_95) v_arrayElimCell_97) 0))) .cse3) (forall ((v_arrayElimCell_95 Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3929 Int) (v_arrayElimCell_97 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3920))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse15 (store .cse14 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3929))) (let ((.cse13 (select (store .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse15) v_arrayElimCell_95))) (or (= (select .cse13 v_arrayElimCell_97) 0) (= 0 (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)) (= (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= (select .cse15 v_arrayElimCell_97) 0)))))))))) is different from false [2022-07-23 06:40:32,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:32,572 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-23 06:40:32,578 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:32,579 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-07-23 06:40:32,593 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-23 06:40:32,593 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 61 [2022-07-23 06:40:32,642 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-23 06:40:32,642 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 51 [2022-07-23 06:40:33,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_43| Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3911 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43|) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3911) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43| v_ArrVal_3920) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0))) is different from false [2022-07-23 06:40:33,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_43| Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3909 Int) (v_ArrVal_3911 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43|) 0)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3909)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3911) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43| v_ArrVal_3920) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0))) is different from false [2022-07-23 06:40:33,197 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_43| Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3909 Int) (v_ArrVal_3906 Int) (v_ArrVal_3911 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_3906) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3909)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3911) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43| v_ArrVal_3920) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43|) 0)))) is different from false [2022-07-23 06:40:33,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_43| Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3909 Int) (v_ArrVal_3906 Int) (v_ArrVal_3911 (Array Int Int)) (v_ArrVal_3904 Int)) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3904) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_3906) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3909)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3911) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43| v_ArrVal_3920) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43|) 0)))) is different from false [2022-07-23 06:40:33,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_43| Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3909 Int) (v_ArrVal_3906 Int) (v_ArrVal_3911 (Array Int Int)) (v_ArrVal_3904 Int)) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3904) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_3906) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3909)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3911) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43| v_ArrVal_3920) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43|) 0)))) is different from false [2022-07-23 06:40:33,258 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-23 06:40:33,259 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 5 case distinctions, treesize of input 41 treesize of output 62 [2022-07-23 06:40:33,276 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-23 06:40:33,277 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 132 treesize of output 114 [2022-07-23 06:40:33,280 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 90 treesize of output 82 [2022-07-23 06:40:33,283 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 43 treesize of output 39 [2022-07-23 06:40:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 67 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 22 not checked. [2022-07-23 06:40:33,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227126227] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:33,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:33,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 23] total 51 [2022-07-23 06:40:33,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658579329] [2022-07-23 06:40:33,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:33,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-23 06:40:33,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:33,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-23 06:40:33,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1646, Unknown=9, NotChecked=712, Total=2550 [2022-07-23 06:40:33,435 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 51 states, 51 states have (on average 3.235294117647059) internal successors, (165), 51 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:35,263 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2022-07-23 06:40:35,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 06:40:35,264 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.235294117647059) internal successors, (165), 51 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-23 06:40:35,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:35,265 INFO L225 Difference]: With dead ends: 150 [2022-07-23 06:40:35,265 INFO L226 Difference]: Without dead ends: 150 [2022-07-23 06:40:35,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 134 SyntacticMatches, 9 SemanticMatches, 68 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=477, Invalid=3326, Unknown=11, NotChecked=1016, Total=4830 [2022-07-23 06:40:35,266 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 402 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1418 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:35,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 995 Invalid, 2451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 998 Invalid, 0 Unknown, 1418 Unchecked, 0.5s Time] [2022-07-23 06:40:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-23 06:40:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2022-07-23 06:40:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 127 states have (on average 1.2125984251968505) internal successors, (154), 140 states have internal predecessors, (154), 0 states have call successors, (0), 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 06:40:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2022-07-23 06:40:35,272 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 77 [2022-07-23 06:40:35,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:35,272 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2022-07-23 06:40:35,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.235294117647059) internal successors, (165), 51 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:35,273 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2022-07-23 06:40:35,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-23 06:40:35,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:35,273 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:35,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-23 06:40:35,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-23 06:40:35,492 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:35,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:35,492 INFO L85 PathProgramCache]: Analyzing trace with hash 323840077, now seen corresponding path program 1 times [2022-07-23 06:40:35,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:35,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124268408] [2022-07-23 06:40:35,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:35,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 65 proven. 41 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 06:40:35,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:35,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124268408] [2022-07-23 06:40:35,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124268408] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:35,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706235897] [2022-07-23 06:40:35,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:35,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:35,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:35,889 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:40:35,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-23 06:40:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:36,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-23 06:40:36,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:36,181 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 06:40:36,200 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:40:36,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:40:36,262 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 13 treesize of output 9 [2022-07-23 06:40:36,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:36,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:36,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:36,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:36,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:36,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:36,332 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 16 treesize of output 18 [2022-07-23 06:40:36,403 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 06:40:36,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:40:36,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:40:36,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:40:36,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:40:36,485 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 13 treesize of output 9 [2022-07-23 06:40:36,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:40:36,493 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 13 treesize of output 9 [2022-07-23 06:40:36,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:36,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:36,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:40:36,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:36,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:36,566 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:36,567 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 79 treesize of output 74 [2022-07-23 06:40:36,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:36,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2022-07-23 06:40:36,574 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 22 treesize of output 24 [2022-07-23 06:40:36,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:36,868 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 33 treesize of output 15 [2022-07-23 06:40:36,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:36,871 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 19 treesize of output 7 [2022-07-23 06:40:36,904 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 15 treesize of output 7 [2022-07-23 06:40:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 71 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-23 06:40:36,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:37,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~head~1#1.offset_44| Int) (v_ArrVal_4325 Int) (v_ArrVal_4326 (Array Int Int)) (v_ArrVal_4327 (Array Int Int))) (or (= (let ((.cse0 (+ |v_ULTIMATE.start_main_~head~1#1.offset_44| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4326) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4327) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)))) 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_44|) (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_44|)))) is different from false [2022-07-23 06:40:37,173 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~head~1#1.offset_44| Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_ArrVal_4326 (Array Int Int)) (v_ArrVal_4321 Int) (v_ArrVal_4327 (Array Int Int)) (v_ArrVal_4322 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_44|) (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_44|)) (= (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~head~1#1.offset_44| 4))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_4322)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4326) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_4321)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4327) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 8))) 0))) is different from false [2022-07-23 06:40:37,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:37,184 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:37,185 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 2 case distinctions, treesize of input 73 treesize of output 79 [2022-07-23 06:40:37,193 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:37,193 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 128 treesize of output 128 [2022-07-23 06:40:37,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:37,201 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:37,202 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 2 case distinctions, treesize of input 112 treesize of output 102 [2022-07-23 06:40:37,206 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 42 treesize of output 38 [2022-07-23 06:40:37,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:37,215 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 160 treesize of output 154 [2022-07-23 06:40:37,219 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 138 treesize of output 130 [2022-07-23 06:40:37,538 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse18 (not .cse1))) (let ((.cse14 (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int)) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse70 (store (select .cse69 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) (.cse71 (+ v_arrayElimCell_131 8))) (or (= (select (select (store .cse69 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse70) v_arrayElimCell_128) .cse71) 0) (= (select .cse70 .cse71) 0))))) .cse18)) (.cse0 (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse6 (or .cse18 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int)) (= (select (select (let ((.cse68 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse68 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse68 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_128) (+ v_arrayElimCell_131 8)) 0)))) (.cse17 (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse66 (select (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse67 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse67 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_128))) (or (= (select .cse66 (+ v_arrayElimCell_131 8)) 0) (= (select .cse66 (+ v_arrayElimCell_129 8)) 0)))) .cse18))) (and (or .cse0 (and (or .cse1 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse2 (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) (let ((.cse4 (select (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2) v_arrayElimCell_128)) (.cse3 (+ v_arrayElimCell_129 8))) (or (= (select .cse2 .cse3) 0) (= (select .cse4 (+ v_arrayElimCell_131 8)) 0) (= (select .cse4 .cse3) 0))))))) .cse6 (or .cse1 (forall ((v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_129 Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325) (+ v_arrayElimCell_129 8)) 0))) (forall ((v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_129 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325) (+ v_arrayElimCell_129 8)) 0) (forall ((v_arrayElimCell_128 Int)) (or (forall ((v_arrayElimCell_131 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) (.cse9 (+ v_arrayElimCell_131 8))) (or (= (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse8) v_arrayElimCell_128) .cse9) 0) (= (select .cse8 .cse9) 0))))) (= (select (select (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_128) (+ v_arrayElimCell_129 8)) 0))))) (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse11 (store (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) (.cse13 (+ v_arrayElimCell_131 8))) (or (= (select .cse11 (+ v_arrayElimCell_129 8)) 0) (= (select (select (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse11) v_arrayElimCell_128) .cse13) 0) (= (select .cse11 .cse13) 0))))) .cse14 (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse15 (store (select .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) (or (= (select .cse15 (+ v_arrayElimCell_129 8)) 0) (= (select (select (store .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse15) v_arrayElimCell_128) (+ v_arrayElimCell_131 8)) 0))))) .cse1) .cse17 (or .cse18 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse21 (store (select .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) (let ((.cse19 (select (store .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse21) v_arrayElimCell_128)) (.cse20 (+ v_arrayElimCell_131 8))) (or (= (select .cse19 .cse20) 0) (= (select .cse19 (+ v_arrayElimCell_129 8)) 0) (= (select .cse21 .cse20) 0))))))))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (and (or .cse1 (forall ((v_ArrVal_4323 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0))) .cse6 (forall ((v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0) (forall ((v_arrayElimCell_128 Int)) (or (forall ((v_arrayElimCell_131 Int)) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse24 (store (select .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) (.cse25 (+ v_arrayElimCell_131 8))) (or (= (select (select (store .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse24) v_arrayElimCell_128) .cse25) 0) (= (select .cse24 .cse25) 0))))) (= (select (select (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_128) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0))))) (or .cse18 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int)) (let ((.cse27 (select (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse28 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse28 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_128))) (or (= (select .cse27 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0) (= (select .cse27 (+ v_arrayElimCell_131 8)) 0))))) (or .cse1 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int)) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse29 (select (store .cse32 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse31 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) v_arrayElimCell_128)) (.cse30 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (or (= (select .cse29 .cse30) 0) (= (select .cse29 (+ v_arrayElimCell_131 8)) 0) (= (select .cse31 .cse30) 0))))))) .cse14 (or .cse18 (forall ((v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int)) (or (forall ((v_arrayElimCell_131 Int)) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse34 (store (select .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) (.cse35 (+ v_arrayElimCell_131 8))) (or (= (select (select (store .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse34) v_arrayElimCell_128) .cse35) 0) (= (select .cse34 .cse35) 0))))) (= (select (select (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse36 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse36 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_128) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0)))) (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int)) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse40 (select .cse37 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse38 (store .cse40 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) (.cse39 (+ v_arrayElimCell_131 8))) (or (= (select (select (store .cse37 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse38) v_arrayElimCell_128) .cse39) 0) (= (select .cse38 .cse39) 0) (= (select .cse40 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0)))))) (or .cse1 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int)) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (= (select (select (store .cse41 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse42 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) v_arrayElimCell_128) (+ v_arrayElimCell_131 8)) 0) (= (select .cse42 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0)))))))) (or .cse0 (and (or .cse1 (forall ((v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_126 Int) (v_arrayElimCell_129 Int)) (= (select (select (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse43 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse43 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_126) (+ v_arrayElimCell_129 8)) 0))) (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_126 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse46 (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse47 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse47 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))))) (let ((.cse45 (+ v_arrayElimCell_131 8)) (.cse44 (select .cse46 v_arrayElimCell_126))) (or (= (select .cse44 .cse45) 0) (= (select (select .cse46 v_arrayElimCell_128) .cse45) 0) (= (select .cse44 (+ v_arrayElimCell_129 8)) 0))))) (forall ((v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_126 Int) (v_arrayElimCell_129 Int)) (or (forall ((v_arrayElimCell_128 Int)) (or (forall ((v_arrayElimCell_131 Int)) (let ((.cse48 (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse50 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse50 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)))) (.cse49 (+ v_arrayElimCell_131 8))) (or (= (select (select .cse48 v_arrayElimCell_126) .cse49) 0) (= (select (select .cse48 v_arrayElimCell_128) .cse49) 0)))) (= (select (select (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse51 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse51 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_128) (+ v_arrayElimCell_129 8)) 0))) (= (select (select (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse52 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse52 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_126) (+ v_arrayElimCell_129 8)) 0))) (or .cse1 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_126 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse55 (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse56 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse56 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))))) (let ((.cse53 (select .cse55 v_arrayElimCell_128)) (.cse54 (+ v_arrayElimCell_129 8))) (or (= (select .cse53 (+ v_arrayElimCell_131 8)) 0) (= (select .cse53 .cse54) 0) (= (select (select .cse55 v_arrayElimCell_126) .cse54) 0)))))) .cse6 (or .cse1 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_126 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse57 (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse58 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse58 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))))) (or (= (select (select .cse57 v_arrayElimCell_128) (+ v_arrayElimCell_131 8)) 0) (= (select (select .cse57 v_arrayElimCell_126) (+ v_arrayElimCell_129 8)) 0))))) (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_126 Int) (v_arrayElimCell_128 Int)) (let ((.cse59 (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse61 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse61 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)))) (.cse60 (+ v_arrayElimCell_131 8))) (or (= (select (select .cse59 v_arrayElimCell_126) .cse60) 0) (= (select (select .cse59 v_arrayElimCell_128) .cse60) 0)))) .cse18) .cse17 (or .cse18 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_126 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse62 (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse65 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse65 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))))) (let ((.cse63 (+ v_arrayElimCell_131 8)) (.cse64 (select .cse62 v_arrayElimCell_128))) (or (= (select (select .cse62 v_arrayElimCell_126) .cse63) 0) (= (select .cse64 .cse63) 0) (= (select .cse64 (+ v_arrayElimCell_129 8)) 0)))))))))))) is different from false [2022-07-23 06:40:38,530 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:38,531 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:40:38,545 INFO L356 Elim1Store]: treesize reduction 18, result has 57.1 percent of original size [2022-07-23 06:40:38,546 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 59 [2022-07-23 06:40:38,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:38,565 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2022-07-23 06:40:38,582 INFO L356 Elim1Store]: treesize reduction 18, result has 57.1 percent of original size [2022-07-23 06:40:38,582 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 71 [2022-07-23 06:40:39,355 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4308 Int) (v_ArrVal_4323 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_46| Int) (v_ArrVal_4309 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_4308)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4309) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_46| v_ArrVal_4323) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_46|) 0)))) is different from false [2022-07-23 06:40:39,475 INFO L356 Elim1Store]: treesize reduction 191, result has 17.7 percent of original size [2022-07-23 06:40:39,476 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 4 case distinctions, treesize of input 40 treesize of output 56 [2022-07-23 06:40:39,479 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 140 treesize of output 122 [2022-07-23 06:40:39,483 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 51 treesize of output 43 [2022-07-23 06:40:39,500 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 94 treesize of output 78 [2022-07-23 06:40:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 67 proven. 13 refuted. 3 times theorem prover too weak. 11 trivial. 17 not checked. [2022-07-23 06:40:39,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706235897] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:39,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:39,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 24] total 53 [2022-07-23 06:40:39,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937299409] [2022-07-23 06:40:39,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:39,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-23 06:40:39,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:39,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-23 06:40:39,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2143, Unknown=24, NotChecked=388, Total=2756 [2022-07-23 06:40:39,669 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand has 53 states, 53 states have (on average 3.2830188679245285) internal successors, (174), 53 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:42,900 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (not .cse2))) (let ((.cse15 (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int)) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse70 (store (select .cse69 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) (.cse71 (+ v_arrayElimCell_131 8))) (or (= (select (select (store .cse69 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse70) v_arrayElimCell_128) .cse71) 0) (= (select .cse70 .cse71) 0))))) .cse0)) (.cse1 (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse7 (or .cse0 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int)) (= (select (select (let ((.cse68 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse68 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse68 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_128) (+ v_arrayElimCell_131 8)) 0)))) (.cse18 (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse66 (select (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse67 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse67 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_128))) (or (= (select .cse66 (+ v_arrayElimCell_131 8)) 0) (= (select .cse66 (+ v_arrayElimCell_129 8)) 0)))) .cse0))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_35| Int)) (and (not (= |v_ULTIMATE.start_dll_create_~head~0#1.base_35| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 1))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 8) 0) .cse0 (or .cse1 (and (or .cse2 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse3 (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) (let ((.cse5 (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse3) v_arrayElimCell_128)) (.cse4 (+ v_arrayElimCell_129 8))) (or (= (select .cse3 .cse4) 0) (= (select .cse5 (+ v_arrayElimCell_131 8)) 0) (= (select .cse5 .cse4) 0))))))) .cse7 (or .cse2 (forall ((v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_129 Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325) (+ v_arrayElimCell_129 8)) 0))) (forall ((v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_129 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325) (+ v_arrayElimCell_129 8)) 0) (forall ((v_arrayElimCell_128 Int)) (or (forall ((v_arrayElimCell_131 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) (.cse10 (+ v_arrayElimCell_131 8))) (or (= (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse9) v_arrayElimCell_128) .cse10) 0) (= (select .cse9 .cse10) 0))))) (= (select (select (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_128) (+ v_arrayElimCell_129 8)) 0))))) (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse12 (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) (.cse14 (+ v_arrayElimCell_131 8))) (or (= (select .cse12 (+ v_arrayElimCell_129 8)) 0) (= (select (select (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse12) v_arrayElimCell_128) .cse14) 0) (= (select .cse12 .cse14) 0))))) .cse15 (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse16 (store (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) (or (= (select .cse16 (+ v_arrayElimCell_129 8)) 0) (= (select (select (store .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse16) v_arrayElimCell_128) (+ v_arrayElimCell_131 8)) 0))))) .cse2) .cse18 (or .cse0 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse21 (store (select .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) (let ((.cse19 (select (store .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse21) v_arrayElimCell_128)) (.cse20 (+ v_arrayElimCell_131 8))) (or (= (select .cse19 .cse20) 0) (= (select .cse19 (+ v_arrayElimCell_129 8)) 0) (= (select .cse21 .cse20) 0))))))))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (and (or .cse2 (forall ((v_ArrVal_4323 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0))) .cse7 (forall ((v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0) (forall ((v_arrayElimCell_128 Int)) (or (forall ((v_arrayElimCell_131 Int)) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse24 (store (select .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) (.cse25 (+ v_arrayElimCell_131 8))) (or (= (select (select (store .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse24) v_arrayElimCell_128) .cse25) 0) (= (select .cse24 .cse25) 0))))) (= (select (select (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_128) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0))))) (or .cse0 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int)) (let ((.cse27 (select (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse28 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse28 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_128))) (or (= (select .cse27 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0) (= (select .cse27 (+ v_arrayElimCell_131 8)) 0))))) (or .cse2 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int)) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse29 (select (store .cse32 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse31 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) v_arrayElimCell_128)) (.cse30 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (or (= (select .cse29 .cse30) 0) (= (select .cse29 (+ v_arrayElimCell_131 8)) 0) (= (select .cse31 .cse30) 0))))))) .cse15 (or .cse0 (forall ((v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int)) (or (forall ((v_arrayElimCell_131 Int)) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse34 (store (select .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) (.cse35 (+ v_arrayElimCell_131 8))) (or (= (select (select (store .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse34) v_arrayElimCell_128) .cse35) 0) (= (select .cse34 .cse35) 0))))) (= (select (select (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse36 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse36 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_128) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0)))) (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int)) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse40 (select .cse37 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse38 (store .cse40 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) (.cse39 (+ v_arrayElimCell_131 8))) (or (= (select (select (store .cse37 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse38) v_arrayElimCell_128) .cse39) 0) (= (select .cse38 .cse39) 0) (= (select .cse40 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0)))))) (or .cse2 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_128 Int)) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (= (select (select (store .cse41 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse42 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)) v_arrayElimCell_128) (+ v_arrayElimCell_131 8)) 0) (= (select .cse42 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0)))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (or .cse1 (and (or .cse2 (forall ((v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_126 Int) (v_arrayElimCell_129 Int)) (= (select (select (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse43 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse43 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_126) (+ v_arrayElimCell_129 8)) 0))) (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_126 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse46 (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse47 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse47 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))))) (let ((.cse45 (+ v_arrayElimCell_131 8)) (.cse44 (select .cse46 v_arrayElimCell_126))) (or (= (select .cse44 .cse45) 0) (= (select (select .cse46 v_arrayElimCell_128) .cse45) 0) (= (select .cse44 (+ v_arrayElimCell_129 8)) 0))))) (forall ((v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_126 Int) (v_arrayElimCell_129 Int)) (or (forall ((v_arrayElimCell_128 Int)) (or (forall ((v_arrayElimCell_131 Int)) (let ((.cse48 (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse50 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse50 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)))) (.cse49 (+ v_arrayElimCell_131 8))) (or (= (select (select .cse48 v_arrayElimCell_126) .cse49) 0) (= (select (select .cse48 v_arrayElimCell_128) .cse49) 0)))) (= (select (select (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse51 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse51 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_128) (+ v_arrayElimCell_129 8)) 0))) (= (select (select (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse52 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse52 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) v_arrayElimCell_126) (+ v_arrayElimCell_129 8)) 0))) (or .cse2 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_126 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse55 (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse56 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse56 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))))) (let ((.cse53 (select .cse55 v_arrayElimCell_128)) (.cse54 (+ v_arrayElimCell_129 8))) (or (= (select .cse53 (+ v_arrayElimCell_131 8)) 0) (= (select .cse53 .cse54) 0) (= (select (select .cse55 v_arrayElimCell_126) .cse54) 0)))))) .cse7 (or .cse2 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_126 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse57 (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse58 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse58 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))))) (or (= (select (select .cse57 v_arrayElimCell_128) (+ v_arrayElimCell_131 8)) 0) (= (select (select .cse57 v_arrayElimCell_126) (+ v_arrayElimCell_129 8)) 0))))) (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_126 Int) (v_arrayElimCell_128 Int)) (let ((.cse59 (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse61 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse61 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325)))) (.cse60 (+ v_arrayElimCell_131 8))) (or (= (select (select .cse59 v_arrayElimCell_126) .cse60) 0) (= (select (select .cse59 v_arrayElimCell_128) .cse60) 0)))) .cse0) .cse18 (or .cse0 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_126 Int) (v_arrayElimCell_128 Int) (v_arrayElimCell_129 Int)) (let ((.cse62 (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse65 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse65 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))))) (let ((.cse63 (+ v_arrayElimCell_131 8)) (.cse64 (select .cse62 v_arrayElimCell_128))) (or (= (select (select .cse62 v_arrayElimCell_126) .cse63) 0) (= (select .cse64 .cse63) 0) (= (select .cse64 (+ v_arrayElimCell_129 8)) 0)))))))))))) is different from true [2022-07-23 06:40:43,612 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((v_ArrVal_4308 Int) (v_ArrVal_4323 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_46| Int) (v_ArrVal_4309 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_4308)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4309) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_46| v_ArrVal_4323) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_46|) 0)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~head~1#1.offset_44| Int) (v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_ArrVal_4326 (Array Int Int)) (v_ArrVal_4321 Int) (v_ArrVal_4327 (Array Int Int)) (v_ArrVal_4322 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_44|) (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_44|)) (= (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~head~1#1.offset_44| 4))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4325))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_4322)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4326) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_4321)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4327) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 8))) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse4 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 8) 0) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4) 0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse4) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-07-23 06:40:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:46,026 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2022-07-23 06:40:46,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 06:40:46,026 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.2830188679245285) internal successors, (174), 53 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-07-23 06:40:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:46,028 INFO L225 Difference]: With dead ends: 150 [2022-07-23 06:40:46,028 INFO L226 Difference]: Without dead ends: 150 [2022-07-23 06:40:46,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 139 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=374, Invalid=3284, Unknown=26, NotChecked=738, Total=4422 [2022-07-23 06:40:46,033 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 155 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 795 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:46,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1084 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 510 Invalid, 0 Unknown, 795 Unchecked, 0.2s Time] [2022-07-23 06:40:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-23 06:40:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2022-07-23 06:40:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 127 states have (on average 1.204724409448819) internal successors, (153), 140 states have internal predecessors, (153), 0 states have call successors, (0), 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 06:40:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2022-07-23 06:40:46,042 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 79 [2022-07-23 06:40:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:46,042 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2022-07-23 06:40:46,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.2830188679245285) internal successors, (174), 53 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2022-07-23 06:40:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-23 06:40:46,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:46,043 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:46,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-23 06:40:46,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:46,244 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:40:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1110523695, now seen corresponding path program 1 times [2022-07-23 06:40:46,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:46,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420002379] [2022-07-23 06:40:46,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:46,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 06:40:46,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:46,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420002379] [2022-07-23 06:40:46,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420002379] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:46,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543484377] [2022-07-23 06:40:46,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:46,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:46,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:46,679 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:40:46,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-23 06:40:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:47,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-23 06:40:47,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:47,024 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 06:40:47,092 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:40:47,093 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 17 treesize of output 21 [2022-07-23 06:40:47,100 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 06:40:47,169 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 13 treesize of output 9 [2022-07-23 06:40:47,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:47,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:47,238 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:47,238 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 44 treesize of output 43 [2022-07-23 06:40:47,319 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:40:47,320 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 06:40:47,336 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-23 06:40:47,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-23 06:40:47,379 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 29 [2022-07-23 06:40:47,391 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 29 [2022-07-23 06:40:47,410 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 29 [2022-07-23 06:40:47,425 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 13 treesize of output 9 [2022-07-23 06:40:47,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 38 treesize of output 29 [2022-07-23 06:40:47,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:47,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:40:47,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:47,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-07-23 06:40:47,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:47,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:47,519 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-23 06:40:47,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 62 [2022-07-23 06:40:47,521 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 43 treesize of output 43 [2022-07-23 06:40:47,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:47,953 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 40 treesize of output 22 [2022-07-23 06:40:48,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:48,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:48,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:48,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:48,090 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-07-23 06:40:48,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 40 [2022-07-23 06:40:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 32 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-23 06:40:48,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:48,637 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4718 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_47| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (.cse3 (+ |v_ULTIMATE.start_main_~head~1#1.offset_47| 4))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4718) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (or (not (<= (+ 16 .cse0) (select |c_#length| .cse1))) (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_47|)) (not (= (select (select .cse2 .cse1) (+ 4 .cse0)) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_47|))))) is different from false [2022-07-23 06:40:48,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4716 Int) (v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4717 Int) (|v_ULTIMATE.start_main_~head~1#1.offset_47| Int)) (let ((.cse3 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse2 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_4717)))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (.cse4 (+ |v_ULTIMATE.start_main_~head~1#1.offset_47| 4))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_4716)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4718) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (or (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_47|)) (not (<= (+ .cse0 16) (select |c_#length| .cse1))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_47|) (not (= (select (select .cse2 .cse1) (+ .cse0 4)) 0))))))) is different from false [2022-07-23 06:40:48,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:48,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:48,685 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 2 case distinctions, treesize of input 199 treesize of output 189 [2022-07-23 06:40:48,696 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:48,697 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 351 treesize of output 345 [2022-07-23 06:40:48,700 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 329 treesize of output 321 [2022-07-23 06:41:13,922 WARN L233 SmtUtils]: Spent 18.77s on a formula simplification. DAG size of input: 68 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:41:13,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:13,938 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:13,939 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 95 [2022-07-23 06:41:13,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:13,960 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:13,960 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 94 [2022-07-23 06:41:13,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:13,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:13,996 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 95 [2022-07-23 06:41:14,020 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_24 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_47| Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_24))) (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_47| 4)))) (or (not (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 0)) (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_47|)) (not (= (select v_arrayElimArr_24 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_47|) (not (<= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16) (select |c_#length| .cse1))))))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_25 (Array Int Int)) (v_arrayElimCell_163 Int) (|v_ULTIMATE.start_main_~head~1#1.offset_47| Int)) (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_25))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_47| 4)))) (or (not (= (select v_arrayElimArr_25 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_47|)) (< (select |c_#length| .cse3) (+ 16 v_arrayElimCell_163)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_47|) (not (= (select (select .cse4 .cse3) (+ v_arrayElimCell_163 4)) 0))))))) (forall ((v_arrayElimCell_162 Int) (v_arrayElimArr_26 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_47| Int)) (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_26))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_47| 4)))) (or (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_47|)) (not (= (select v_arrayElimArr_26 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |v_ULTIMATE.start_main_~head~1#1.offset_47| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (<= (+ 16 v_arrayElimCell_162) (select |c_#length| .cse6))) (not (= (select (select .cse7 .cse6) (+ v_arrayElimCell_162 4)) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_47|)))))) is different from false [2022-07-23 06:41:14,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:14,246 INFO L356 Elim1Store]: treesize reduction 47, result has 46.0 percent of original size [2022-07-23 06:41:14,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 133 [2022-07-23 06:41:14,265 INFO L356 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2022-07-23 06:41:14,265 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 84 treesize of output 78 [2022-07-23 06:41:14,862 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:41:14,863 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 2 case distinctions, treesize of input 190 treesize of output 120 [2022-07-23 06:41:14,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:14,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:14,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:14,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:14,872 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:14,872 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 495 treesize of output 425 [2022-07-23 06:41:14,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:14,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:14,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 425 treesize of output 289 [2022-07-23 06:41:14,889 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 64 treesize of output 60 [2022-07-23 06:41:15,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2022-07-23 06:41:15,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543484377] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:41:15,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:41:15,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 22] total 57 [2022-07-23 06:41:15,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649026229] [2022-07-23 06:41:15,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:41:15,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-23 06:41:15,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:41:15,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-23 06:41:15,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2690, Unknown=12, NotChecked=318, Total=3192 [2022-07-23 06:41:15,244 INFO L87 Difference]: Start difference. First operand 141 states and 153 transitions. Second operand has 57 states, 57 states have (on average 3.245614035087719) internal successors, (185), 57 states have internal predecessors, (185), 0 states have call successors, (0), 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 06:41:17,560 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 20) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_4716 Int) (v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4717 Int) (|v_ULTIMATE.start_main_~head~1#1.offset_47| Int)) (let ((.cse3 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse2 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_4717)))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (.cse4 (+ |v_ULTIMATE.start_main_~head~1#1.offset_47| 4))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_4716)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4718) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (or (not (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_47|)) (not (<= (+ .cse0 16) (select |c_#length| .cse1))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_47|) (not (= (select (select .cse2 .cse1) (+ .cse0 4)) 0))))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) 0)) (= .cse8 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 20) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse8) (not (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse6 0)) (= (select (select |c_#memory_int| .cse6) 0) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)))) is different from false [2022-07-23 06:41:18,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:41:18,363 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2022-07-23 06:41:18,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 06:41:18,364 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.245614035087719) internal successors, (185), 57 states have internal predecessors, (185), 0 states have call successors, (0), 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 80 [2022-07-23 06:41:18,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:41:18,364 INFO L225 Difference]: With dead ends: 133 [2022-07-23 06:41:18,364 INFO L226 Difference]: Without dead ends: 133 [2022-07-23 06:41:18,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 137 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=477, Invalid=4782, Unknown=13, NotChecked=580, Total=5852 [2022-07-23 06:41:18,366 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 56 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 718 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:41:18,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1722 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 707 Invalid, 0 Unknown, 718 Unchecked, 0.3s Time] [2022-07-23 06:41:18,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-23 06:41:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 127. [2022-07-23 06:41:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.1946902654867257) internal successors, (135), 126 states have internal predecessors, (135), 0 states have call successors, (0), 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 06:41:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2022-07-23 06:41:18,368 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 80 [2022-07-23 06:41:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:41:18,368 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2022-07-23 06:41:18,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.245614035087719) internal successors, (185), 57 states have internal predecessors, (185), 0 states have call successors, (0), 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 06:41:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2022-07-23 06:41:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-23 06:41:18,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:41:18,368 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:41:18,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-23 06:41:18,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-07-23 06:41:18,583 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:41:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:41:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1974245714, now seen corresponding path program 1 times [2022-07-23 06:41:18,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:41:18,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676881011] [2022-07-23 06:41:18,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:41:18,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:41:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:41:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 64 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 06:41:18,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:41:18,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676881011] [2022-07-23 06:41:18,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676881011] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:41:18,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400700422] [2022-07-23 06:41:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:41:18,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:41:18,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:41:18,996 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:41:18,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-23 06:41:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:41:19,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-23 06:41:19,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:41:19,320 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 06:41:19,337 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 06:41:19,348 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:41:19,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:41:19,405 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 13 treesize of output 9 [2022-07-23 06:41:19,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:19,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:41:19,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:19,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:41:19,468 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 16 treesize of output 18 [2022-07-23 06:41:19,540 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:41:19,540 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 06:41:19,554 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 06:41:19,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:41:19,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:41:19,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:41:19,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:41:19,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:41:19,612 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 13 treesize of output 9 [2022-07-23 06:41:19,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:41:19,651 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 06:41:19,651 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:41:19,670 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:41:19,670 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 72 treesize of output 67 [2022-07-23 06:41:19,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:19,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2022-07-23 06:41:19,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2022-07-23 06:41:19,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-23 06:41:19,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:19,935 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 17 treesize of output 7 [2022-07-23 06:41:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 70 proven. 32 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-23 06:41:19,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:41:20,137 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 52 treesize of output 34 [2022-07-23 06:41:20,429 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:41:20,430 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 2 case distinctions, treesize of input 82 treesize of output 72 [2022-07-23 06:41:20,432 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 116 treesize of output 98 [2022-07-23 06:41:20,436 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 64 treesize of output 56 [2022-07-23 06:41:20,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:20,708 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:41:21,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:21,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:21,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:21,336 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:21,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 82 [2022-07-23 06:41:21,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:21,346 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:21,347 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 517 treesize of output 507 [2022-07-23 06:41:21,357 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 458 treesize of output 434 [2022-07-23 06:41:21,378 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 594 treesize of output 546 [2022-07-23 06:41:22,295 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 7 treesize of output 3 [2022-07-23 06:41:22,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:22,323 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 42 treesize of output 46 [2022-07-23 06:41:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 70 proven. 32 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-23 06:41:25,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400700422] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:41:25,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:41:25,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 23] total 54 [2022-07-23 06:41:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140199837] [2022-07-23 06:41:25,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:41:25,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-23 06:41:25,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:41:25,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-23 06:41:25,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2629, Unknown=39, NotChecked=0, Total=2862 [2022-07-23 06:41:25,186 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand has 54 states, 54 states have (on average 3.462962962962963) internal successors, (187), 54 states have internal predecessors, (187), 0 states have call successors, (0), 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 06:41:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:41:26,509 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2022-07-23 06:41:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-23 06:41:26,509 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.462962962962963) internal successors, (187), 54 states have internal predecessors, (187), 0 states have call successors, (0), 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 81 [2022-07-23 06:41:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:41:26,510 INFO L225 Difference]: With dead ends: 131 [2022-07-23 06:41:26,510 INFO L226 Difference]: Without dead ends: 131 [2022-07-23 06:41:26,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=513, Invalid=5148, Unknown=39, NotChecked=0, Total=5700 [2022-07-23 06:41:26,512 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 156 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 678 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:41:26,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1096 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 842 Invalid, 0 Unknown, 678 Unchecked, 0.4s Time] [2022-07-23 06:41:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-23 06:41:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2022-07-23 06:41:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 115 states have (on average 1.191304347826087) internal successors, (137), 128 states have internal predecessors, (137), 0 states have call successors, (0), 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 06:41:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2022-07-23 06:41:26,514 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 81 [2022-07-23 06:41:26,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:41:26,514 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2022-07-23 06:41:26,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.462962962962963) internal successors, (187), 54 states have internal predecessors, (187), 0 states have call successors, (0), 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 06:41:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2022-07-23 06:41:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 06:41:26,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:41:26,514 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:41:26,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-23 06:41:26,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:41:26,727 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:41:26,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:41:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1125408756, now seen corresponding path program 2 times [2022-07-23 06:41:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:41:26,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530401062] [2022-07-23 06:41:26,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:41:26,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:41:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:41:27,136 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 64 proven. 48 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 06:41:27,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:41:27,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530401062] [2022-07-23 06:41:27,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530401062] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:41:27,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287778494] [2022-07-23 06:41:27,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:41:27,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:41:27,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:41:27,138 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:41:27,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-23 06:41:27,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:41:27,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:41:27,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-23 06:41:27,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:41:27,478 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 06:41:27,498 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:41:27,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:41:27,503 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 06:41:27,574 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 13 treesize of output 9 [2022-07-23 06:41:27,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:27,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:41:27,629 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:41:27,630 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 34 treesize of output 35 [2022-07-23 06:41:27,709 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-23 06:41:27,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-23 06:41:27,719 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 12 treesize of output 14 [2022-07-23 06:41:27,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 32 treesize of output 30 [2022-07-23 06:41:27,811 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 32 treesize of output 30 [2022-07-23 06:41:27,826 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 32 treesize of output 30 [2022-07-23 06:41:27,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-07-23 06:41:27,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:27,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2022-07-23 06:41:27,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:27,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:27,928 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-23 06:41:27,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 56 [2022-07-23 06:41:28,349 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 9 treesize of output 3 [2022-07-23 06:41:28,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:28,706 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 9 [2022-07-23 06:41:28,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:28,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:28,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:28,838 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-23 06:41:28,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 35 [2022-07-23 06:41:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 80 proven. 26 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-23 06:41:28,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:41:29,079 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 54 treesize of output 36 [2022-07-23 06:41:44,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:44,667 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:44,667 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 96 [2022-07-23 06:41:49,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:49,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:49,100 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 2 case distinctions, treesize of input 194 treesize of output 124 [2022-07-23 06:41:49,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:41:49,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:49,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:49,167 INFO L356 Elim1Store]: treesize reduction 38, result has 67.0 percent of original size [2022-07-23 06:41:49,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 12716 treesize of output 12125 [2022-07-23 06:41:49,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:49,243 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 12798 treesize of output 12546 [2022-07-23 06:41:49,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:49,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:49,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18067 treesize of output 15931 [2022-07-23 06:41:50,241 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 4786 treesize of output 4778 [2022-07-23 06:41:52,659 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 12 treesize of output 8 [2022-07-23 06:41:52,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:52,811 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 831 treesize of output 843 [2022-07-23 06:42:29,121 WARN L233 SmtUtils]: Spent 27.07s on a formula simplification. DAG size of input: 396 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:42:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 60 proven. 44 refuted. 2 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-23 06:42:29,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287778494] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:42:29,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:42:29,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 24] total 59 [2022-07-23 06:42:29,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434758703] [2022-07-23 06:42:29,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:42:29,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-23 06:42:29,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:29,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-23 06:42:29,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=3262, Unknown=27, NotChecked=0, Total=3540 [2022-07-23 06:42:29,442 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand has 60 states, 59 states have (on average 3.288135593220339) internal successors, (194), 60 states have internal predecessors, (194), 0 states have call successors, (0), 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 06:42:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:30,452 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2022-07-23 06:42:30,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 06:42:30,453 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 3.288135593220339) internal successors, (194), 60 states have internal predecessors, (194), 0 states have call successors, (0), 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 83 [2022-07-23 06:42:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:30,454 INFO L225 Difference]: With dead ends: 134 [2022-07-23 06:42:30,454 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 06:42:30,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 140 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1763 ImplicationChecksByTransitivity, 49.5s TimeCoverageRelationStatistics Valid=442, Invalid=4787, Unknown=27, NotChecked=0, Total=5256 [2022-07-23 06:42:30,456 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 111 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 553 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:30,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1090 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 524 Invalid, 0 Unknown, 553 Unchecked, 0.3s Time] [2022-07-23 06:42:30,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 06:42:30,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2022-07-23 06:42:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 118 states have (on average 1.194915254237288) internal successors, (141), 131 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2022-07-23 06:42:30,458 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 83 [2022-07-23 06:42:30,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:30,458 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2022-07-23 06:42:30,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 3.288135593220339) internal successors, (194), 60 states have internal predecessors, (194), 0 states have call successors, (0), 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 06:42:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-07-23 06:42:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 06:42:30,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:30,459 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:30,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-23 06:42:30,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:42:30,659 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:42:30,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:30,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1125408755, now seen corresponding path program 2 times [2022-07-23 06:42:30,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:30,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205360505] [2022-07-23 06:42:30,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:30,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 60 proven. 54 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 06:42:31,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:31,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205360505] [2022-07-23 06:42:31,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205360505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:42:31,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489207235] [2022-07-23 06:42:31,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:42:31,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:42:31,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:42:31,271 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:42:31,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-23 06:42:31,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:42:31,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:42:31,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-23 06:42:31,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:42:31,709 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 06:42:31,791 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:42:31,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:42:31,857 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 13 treesize of output 9 [2022-07-23 06:42:31,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 13 treesize of output 9 [2022-07-23 06:42:31,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:31,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:42:31,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:31,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:42:31,937 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:42:31,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2022-07-23 06:42:31,940 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 41 treesize of output 41 [2022-07-23 06:42:32,026 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-23 06:42:32,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-23 06:42:32,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 06:42:32,075 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 38 treesize of output 36 [2022-07-23 06:42:32,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-07-23 06:42:32,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-07-23 06:42:32,092 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 38 treesize of output 36 [2022-07-23 06:42:32,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-07-23 06:42:32,106 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 38 treesize of output 36 [2022-07-23 06:42:32,116 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 45 treesize of output 36 [2022-07-23 06:42:32,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2022-07-23 06:42:32,172 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 06:42:32,173 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-23 06:42:32,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:32,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2022-07-23 06:42:32,211 INFO L356 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-07-23 06:42:32,211 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 119 treesize of output 62 [2022-07-23 06:42:32,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-07-23 06:42:32,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:42:32,815 INFO L356 Elim1Store]: treesize reduction 51, result has 5.6 percent of original size [2022-07-23 06:42:32,815 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 52 [2022-07-23 06:42:32,819 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:42:32,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 18 [2022-07-23 06:42:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-23 06:42:32,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:42:40,978 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_5899 Int) (v_ArrVal_5895 Int) (v_ArrVal_5893 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12)) (.cse5 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse8 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12))) (let ((.cse0 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) .cse8 v_ArrVal_5893)))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_5899))))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (or (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_5895)))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse2 (+ .cse4 4))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2))))) (not (<= 0 .cse4))))))) (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_5899 Int) (v_ArrVal_5895 Int) (v_ArrVal_5893 Int)) (let ((.cse12 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12)) (.cse13 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse14 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12))) (let ((.cse10 (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) .cse14 v_ArrVal_5893)))) (store .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse12 v_ArrVal_5899))))) (let ((.cse15 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse13))) (or (<= 0 (+ (select (select .cse10 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse14 v_ArrVal_5895)))) (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse13)) (+ .cse15 4)) 4)) (not (<= 0 .cse15)))))))) is different from false [2022-07-23 06:42:41,002 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-23 06:42:41,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 134 [2022-07-23 06:42:41,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:42:41,010 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:42:41,010 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 88 [2022-07-23 06:42:41,039 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-23 06:42:41,039 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 306 treesize of output 242 [2022-07-23 06:42:41,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:42:41,050 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:42:41,050 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 199 treesize of output 156 [2022-07-23 06:42:41,067 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_arrayElimArr_37 (Array Int Int)) (v_arrayElimArr_36 (Array Int Int)) (v_ArrVal_5899 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse2 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_36))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_5899)))) (.cse0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_36 .cse0))) (not (<= 0 .cse1)) (not (= (select v_arrayElimArr_37 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_37))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (.cse4 (+ .cse1 4))) (<= (+ (select (select .cse2 .cse3) .cse4) 8) (select |c_#length| (select (select .cse5 .cse3) .cse4)))))))))) (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_arrayElimArr_35 (Array Int Int)) (v_arrayElimArr_34 (Array Int Int)) (v_ArrVal_5899 Int)) (let ((.cse12 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse10 (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_34))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse12 v_ArrVal_5899)))) (.cse9 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse13 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse9))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_34 .cse9))) (<= 0 (+ 4 (select (select .cse10 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_35))) (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse9)) (+ .cse13 4)))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select v_arrayElimArr_35 .cse9))) (not (<= 0 .cse13)))))))) is different from false [2022-07-23 06:42:41,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:42:41,572 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 650 treesize of output 654 [2022-07-23 06:42:43,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:42:43,152 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:42:43,152 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 2 case distinctions, treesize of input 240 treesize of output 200 [2022-07-23 06:42:43,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:42:43,165 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:42:43,165 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 2 case distinctions, treesize of input 147 treesize of output 108 [2022-07-23 06:42:43,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:42:43,173 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 762 treesize of output 756 [2022-07-23 06:42:43,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:42:43,252 INFO L356 Elim1Store]: treesize reduction 38, result has 67.0 percent of original size [2022-07-23 06:42:43,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 146800 treesize of output 141799 [2022-07-23 06:42:43,845 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 76622 treesize of output 75610 [2022-07-23 06:42:44,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:42:44,177 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 76644 treesize of output 75640 [2022-07-23 06:42:44,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:42:45,017 INFO L356 Elim1Store]: treesize reduction 123, result has 50.0 percent of original size [2022-07-23 06:42:45,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 189692 treesize of output 174934 [2022-07-23 06:42:51,517 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 917 DAG size of output: 915 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:42:51,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:42:51,757 INFO L356 Elim1Store]: treesize reduction 123, result has 50.0 percent of original size [2022-07-23 06:42:51,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 179295 treesize of output 155221 [2022-07-23 06:42:56,991 WARN L233 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 973 DAG size of output: 965 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:43:03,669 WARN L233 SmtUtils]: Spent 6.67s on a formula simplification. DAG size of input: 926 DAG size of output: 825 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:43:03,726 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 113392 treesize of output 110444 [2022-07-23 06:43:10,926 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-23 06:43:10,926 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 107646 treesize of output 1 [2022-07-23 06:43:14,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:43:14,563 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 86 treesize of output 90 [2022-07-23 06:43:14,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:14,632 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:43:14,632 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 2 case distinctions, treesize of input 242 treesize of output 172 [2022-07-23 06:43:14,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:14,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:43:14,645 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 2 case distinctions, treesize of input 119 treesize of output 110 [2022-07-23 06:43:14,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:14,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:14,661 INFO L356 Elim1Store]: treesize reduction 32, result has 11.1 percent of original size [2022-07-23 06:43:14,662 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 8130 treesize of output 7740 [2022-07-23 06:43:14,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:14,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:14,684 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 6396 treesize of output 6390 [2022-07-23 06:43:14,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:14,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:14,718 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 6314 treesize of output 6086 [2022-07-23 06:43:14,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:14,749 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 5922 treesize of output 5570 [2022-07-23 06:43:14,766 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 5578 treesize of output 4070 [2022-07-23 06:43:14,784 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 35 treesize of output 23 [2022-07-23 06:43:14,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:14,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:43:14,900 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 2 case distinctions, treesize of input 242 treesize of output 172 [2022-07-23 06:43:14,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:14,912 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:43:14,912 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 2 case distinctions, treesize of input 119 treesize of output 110 [2022-07-23 06:43:14,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:14,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:14,930 INFO L356 Elim1Store]: treesize reduction 32, result has 11.1 percent of original size [2022-07-23 06:43:14,931 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 10890 treesize of output 10348 [2022-07-23 06:43:14,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:14,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:14,961 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 8556 treesize of output 8550 [2022-07-23 06:43:15,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:15,017 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 8386 treesize of output 8002 [2022-07-23 06:43:15,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:15,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:15,068 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 7850 treesize of output 7462 [2022-07-23 06:43:15,225 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 5562 treesize of output 4054 [2022-07-23 06:43:15,247 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 35 treesize of output 23 [2022-07-23 06:43:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 60 proven. 34 refuted. 2 times theorem prover too weak. 11 trivial. 10 not checked. [2022-07-23 06:43:15,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489207235] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:43:15,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:43:15,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 21] total 59 [2022-07-23 06:43:15,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658908814] [2022-07-23 06:43:15,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:43:15,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-23 06:43:15,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:43:15,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-23 06:43:15,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3100, Unknown=12, NotChecked=226, Total=3540 [2022-07-23 06:43:15,823 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 60 states, 59 states have (on average 3.5254237288135593) internal successors, (208), 60 states have internal predecessors, (208), 0 states have call successors, (0), 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 06:43:16,427 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse1 (select |c_#length| .cse0))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 20) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= .cse1 20) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse2 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 20) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (+ .cse2 16) .cse1) (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_arrayElimArr_37 (Array Int Int)) (v_arrayElimArr_36 (Array Int Int)) (v_ArrVal_5899 Int)) (let ((.cse10 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse5 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_36))) (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse10 v_ArrVal_5899)))) (.cse3 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_36 .cse3))) (not (<= 0 .cse4)) (not (= (select v_arrayElimArr_37 .cse3) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_37))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)) (.cse7 (+ .cse4 4))) (<= (+ (select (select .cse5 .cse6) .cse7) 8) (select |c_#length| (select (select .cse8 .cse6) .cse7)))))))))) (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_arrayElimArr_35 (Array Int Int)) (v_arrayElimArr_34 (Array Int Int)) (v_ArrVal_5899 Int)) (let ((.cse15 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse13 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_34))) (store .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse15 v_ArrVal_5899)))) (.cse12 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse16 (select (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse12))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_34 .cse12))) (<= 0 (+ 4 (select (select .cse13 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_35))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse12)) (+ .cse16 4)))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select v_arrayElimArr_35 .cse12))) (not (<= 0 .cse16))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-07-23 06:43:19,058 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse22 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse23 .cse22))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1)) (.cse0 (select .cse23 4)) (.cse21 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse4 (select .cse21 4)) (.cse3 (select |c_#length| .cse0)) (.cse5 (select .cse2 4))) (and (= (select |c_#length| (select (select |c_#memory_$Pointer$.base| .cse0) 4)) 20) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 20) (not (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select .cse2 12) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0) (= .cse3 20) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse4 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 20) (<= 16 (select |c_#length| .cse5)) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (+ .cse4 16) .cse3) (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_arrayElimArr_37 (Array Int Int)) (v_arrayElimArr_36 (Array Int Int)) (v_ArrVal_5899 Int)) (let ((.cse13 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse8 (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_36))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse13 v_ArrVal_5899)))) (.cse6 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_36 .cse6))) (not (<= 0 .cse7)) (not (= (select v_arrayElimArr_37 .cse6) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_37))) (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (.cse10 (+ .cse7 4))) (<= (+ (select (select .cse8 .cse9) .cse10) 8) (select |c_#length| (select (select .cse11 .cse9) .cse10)))))))))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_arrayElimArr_35 (Array Int Int)) (v_arrayElimArr_34 (Array Int Int)) (v_ArrVal_5899 Int)) (let ((.cse18 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse16 (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_34))) (store .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse18 v_ArrVal_5899)))) (.cse15 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse19 (select (select .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse15))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_34 .cse15))) (<= 0 (+ 4 (select (select .cse16 (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_35))) (store .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse15)) (+ .cse19 4)))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select v_arrayElimArr_35 .cse15))) (not (<= 0 .cse19))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select .cse21 .cse22) 0) (not (= .cse1 .cse5))))))) is different from false [2022-07-23 06:43:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:43:22,346 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2022-07-23 06:43:22,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-23 06:43:22,346 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 3.5254237288135593) internal successors, (208), 60 states have internal predecessors, (208), 0 states have call successors, (0), 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 83 [2022-07-23 06:43:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:43:22,347 INFO L225 Difference]: With dead ends: 186 [2022-07-23 06:43:22,347 INFO L226 Difference]: Without dead ends: 186 [2022-07-23 06:43:22,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 138 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=598, Invalid=4954, Unknown=14, NotChecked=596, Total=6162 [2022-07-23 06:43:22,348 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 365 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 649 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:43:22,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1535 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1436 Invalid, 0 Unknown, 649 Unchecked, 0.8s Time] [2022-07-23 06:43:22,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-23 06:43:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 155. [2022-07-23 06:43:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 141 states have (on average 1.198581560283688) internal successors, (169), 154 states have internal predecessors, (169), 0 states have call successors, (0), 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 06:43:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2022-07-23 06:43:22,351 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 83 [2022-07-23 06:43:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:43:22,351 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2022-07-23 06:43:22,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 3.5254237288135593) internal successors, (208), 60 states have internal predecessors, (208), 0 states have call successors, (0), 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 06:43:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2022-07-23 06:43:22,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-23 06:43:22,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:43:22,351 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:43:22,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-23 06:43:22,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-23 06:43:22,568 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-23 06:43:22,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:43:22,568 INFO L85 PathProgramCache]: Analyzing trace with hash -915181903, now seen corresponding path program 2 times [2022-07-23 06:43:22,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:43:22,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626234993] [2022-07-23 06:43:22,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:43:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:23,267 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 64 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:43:23,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:43:23,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626234993] [2022-07-23 06:43:23,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626234993] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:43:23,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109467462] [2022-07-23 06:43:23,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:43:23,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:43:23,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:43:23,269 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:43:23,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-23 06:43:23,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:43:23,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:43:23,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 140 conjunts are in the unsatisfiable core [2022-07-23 06:43:23,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:43:23,656 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 06:43:23,680 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:43:23,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:43:23,725 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 06:43:23,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:23,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:43:23,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:23,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:23,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:23,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-23 06:43:23,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:23,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:23,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:23,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-23 06:43:23,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:23,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:23,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:23,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-23 06:43:23,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-23 06:43:23,968 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-23 06:43:23,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-23 06:43:24,036 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 21 [2022-07-23 06:43:24,052 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 21 [2022-07-23 06:43:24,072 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 21 [2022-07-23 06:43:24,081 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 13 treesize of output 9 [2022-07-23 06:43:24,089 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 13 treesize of output 9 [2022-07-23 06:43:24,102 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 21 [2022-07-23 06:43:24,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:24,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:43:24,184 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 21 [2022-07-23 06:43:24,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:24,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:43:24,240 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:43:24,251 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 102 [2022-07-23 06:43:24,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:24,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:24,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-07-23 06:43:24,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 06:43:24,368 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-07-23 06:43:24,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2022-07-23 06:43:24,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:43:24,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-07-23 06:43:24,411 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 45 treesize of output 41 [2022-07-23 06:43:24,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:43:24,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-07-23 06:43:24,426 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 45 treesize of output 41 [2022-07-23 06:43:24,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:43:24,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-07-23 06:43:24,438 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 45 treesize of output 41 [2022-07-23 06:43:24,448 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 06:43:24,452 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 52 treesize of output 39 [2022-07-23 06:43:24,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-07-23 06:43:24,496 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 06:43:24,499 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 51 [2022-07-23 06:43:24,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-07-23 06:43:24,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:24,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-23 06:43:24,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:24,533 INFO L356 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2022-07-23 06:43:24,533 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 166 treesize of output 93 [2022-07-23 06:43:24,540 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-23 06:43:24,540 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 75 treesize of output 62 [2022-07-23 06:43:24,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2022-07-23 06:43:25,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:25,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:25,189 INFO L356 Elim1Store]: treesize reduction 59, result has 4.8 percent of original size [2022-07-23 06:43:25,190 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 155 treesize of output 61 [2022-07-23 06:43:25,194 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:43:25,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 18 [2022-07-23 06:43:25,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:43:25,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-07-23 06:43:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 68 proven. 62 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:43:25,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:43:25,479 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6322 (Array Int Int)) (v_ArrVal_6320 Int)) (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_6320))) (.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (or (= (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse2 (+ .cse4 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_6322) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) 0) (<= (+ .cse4 1) 0)))))) is different from false [2022-07-23 06:43:25,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6322 (Array Int Int)) (v_ArrVal_6317 Int) (v_ArrVal_6316 Int) (v_ArrVal_6319 (Array Int Int)) (v_ArrVal_6320 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12)) (.cse8 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse4 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse8 v_ArrVal_6316)))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_6320)))) (.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (or (<= (+ .cse0 1) 0) (= (let ((.cse1 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse8 v_ArrVal_6317)))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse3 (+ .cse0 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_6319) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_6322) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))) 0)))))) is different from false [2022-07-23 06:43:25,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_6322 (Array Int Int)) (v_ArrVal_6317 Int) (v_ArrVal_6316 Int) (v_ArrVal_6319 (Array Int Int)) (v_ArrVal_6320 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12)) (.cse5 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse8 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12))) (let ((.cse3 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) .cse8 v_ArrVal_6316)))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_6320))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (or (= (let ((.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_6317)))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse2 (+ .cse4 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_6319) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_6322) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) 0) (<= (+ .cse4 1) 0)))))) is different from false [2022-07-23 06:43:25,538 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-23 06:43:25,538 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 313 treesize of output 249 [2022-07-23 06:43:25,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:25,545 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:43:25,545 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 205 treesize of output 162 [2022-07-23 06:43:25,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_44 (Array Int Int)) (|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_6322 (Array Int Int)) (v_arrayElimArr_45 (Array Int Int)) (v_ArrVal_6319 (Array Int Int)) (v_ArrVal_6320 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_44))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_6320)))) (.cse1 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (or (<= (+ .cse0 1) 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_44 .cse1))) (= (let ((.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_45))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) (.cse4 (+ .cse0 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_6319) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_6322) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))) 0) (not (= (select v_arrayElimArr_45 .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) is different from false [2022-07-23 06:43:26,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:26,318 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:43:26,318 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 2 case distinctions, treesize of input 501 treesize of output 401 [2022-07-23 06:43:26,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:26,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:43:26,331 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 2 case distinctions, treesize of input 339 treesize of output 270 [2022-07-23 06:43:26,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:26,359 INFO L356 Elim1Store]: treesize reduction 44, result has 8.3 percent of original size [2022-07-23 06:43:26,360 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 259769 treesize of output 252831 [2022-07-23 06:43:26,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:26,804 INFO L356 Elim1Store]: treesize reduction 38, result has 67.0 percent of original size [2022-07-23 06:43:26,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 8129016 treesize of output 7712399