./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 f4b24e32 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-?-f4b24e3 [2022-07-14 07:01:33,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 07:01:33,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 07:01:33,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 07:01:33,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 07:01:33,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 07:01:33,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 07:01:33,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 07:01:33,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 07:01:33,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 07:01:33,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 07:01:33,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 07:01:33,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 07:01:33,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 07:01:33,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 07:01:33,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 07:01:33,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 07:01:33,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 07:01:33,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 07:01:33,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 07:01:33,855 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 07:01:33,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 07:01:33,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 07:01:33,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 07:01:33,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 07:01:33,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 07:01:33,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 07:01:33,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 07:01:33,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 07:01:33,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 07:01:33,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 07:01:33,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 07:01:33,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 07:01:33,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 07:01:33,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 07:01:33,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 07:01:33,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 07:01:33,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 07:01:33,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 07:01:33,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 07:01:33,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 07:01:33,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 07:01:33,878 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 07:01:33,906 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 07:01:33,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 07:01:33,907 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 07:01:33,908 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 07:01:33,908 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 07:01:33,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 07:01:33,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 07:01:33,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 07:01:33,909 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 07:01:33,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 07:01:33,910 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 07:01:33,911 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 07:01:33,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 07:01:33,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 07:01:33,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 07:01:33,911 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 07:01:33,912 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 07:01:33,912 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 07:01:33,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 07:01:33,912 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 07:01:33,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 07:01:33,913 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 07:01:33,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 07:01:33,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 07:01:33,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 07:01:33,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:01:33,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 07:01:33,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 07:01:33,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 07:01:33,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 07:01:33,915 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-14 07:01:34,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 07:01:34,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 07:01:34,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 07:01:34,213 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 07:01:34,213 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 07:01:34,214 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-14 07:01:34,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f7bd7cf1/fb0cf5b935e340d99dc78d313debf8d0/FLAG3d0b5cf10 [2022-07-14 07:01:34,687 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 07:01:34,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2022-07-14 07:01:34,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f7bd7cf1/fb0cf5b935e340d99dc78d313debf8d0/FLAG3d0b5cf10 [2022-07-14 07:01:34,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f7bd7cf1/fb0cf5b935e340d99dc78d313debf8d0 [2022-07-14 07:01:34,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 07:01:34,721 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 07:01:34,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 07:01:34,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 07:01:34,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 07:01:34,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:01:34" (1/1) ... [2022-07-14 07:01:34,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ed8d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:01:34, skipping insertion in model container [2022-07-14 07:01:34,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:01:34" (1/1) ... [2022-07-14 07:01:34,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 07:01:34,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 07:01:35,006 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-14 07:01:35,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:01:35,018 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 07:01:35,083 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-14 07:01:35,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:01:35,115 INFO L208 MainTranslator]: Completed translation [2022-07-14 07:01:35,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:01:35 WrapperNode [2022-07-14 07:01:35,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 07:01:35,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 07:01:35,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 07:01:35,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 07:01:35,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:01:35" (1/1) ... [2022-07-14 07:01:35,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:01:35" (1/1) ... [2022-07-14 07:01:35,178 INFO L137 Inliner]: procedures = 122, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2022-07-14 07:01:35,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 07:01:35,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 07:01:35,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 07:01:35,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 07:01:35,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:01:35" (1/1) ... [2022-07-14 07:01:35,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:01:35" (1/1) ... [2022-07-14 07:01:35,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:01:35" (1/1) ... [2022-07-14 07:01:35,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:01:35" (1/1) ... [2022-07-14 07:01:35,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:01:35" (1/1) ... [2022-07-14 07:01:35,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:01:35" (1/1) ... [2022-07-14 07:01:35,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:01:35" (1/1) ... [2022-07-14 07:01:35,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 07:01:35,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 07:01:35,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 07:01:35,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 07:01:35,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:01:35" (1/1) ... [2022-07-14 07:01:35,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:01:35,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:01:35,245 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-14 07:01:35,246 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-14 07:01:35,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 07:01:35,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 07:01:35,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 07:01:35,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 07:01:35,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 07:01:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 07:01:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 07:01:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 07:01:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 07:01:35,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 07:01:35,354 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 07:01:35,356 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 07:01:35,636 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 07:01:35,642 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 07:01:35,642 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 07:01:35,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:01:35 BoogieIcfgContainer [2022-07-14 07:01:35,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 07:01:35,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 07:01:35,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 07:01:35,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 07:01:35,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 07:01:34" (1/3) ... [2022-07-14 07:01:35,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4418ab14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:01:35, skipping insertion in model container [2022-07-14 07:01:35,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:01:35" (2/3) ... [2022-07-14 07:01:35,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4418ab14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:01:35, skipping insertion in model container [2022-07-14 07:01:35,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:01:35" (3/3) ... [2022-07-14 07:01:35,657 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2022-07-14 07:01:35,675 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 07:01:35,675 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2022-07-14 07:01:35,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 07:01:35,723 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@2fc20ae1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@49735df4 [2022-07-14 07:01:35,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2022-07-14 07:01:35,727 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-14 07:01:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 07:01:35,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:35,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 07:01:35,733 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-14 07:01:35,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:35,738 INFO L85 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2022-07-14 07:01:35,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:35,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889537761] [2022-07-14 07:01:35,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:35,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:35,872 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-14 07:01:35,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:35,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889537761] [2022-07-14 07:01:35,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889537761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:01:35,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:01:35,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:01:35,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409457400] [2022-07-14 07:01:35,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:01:35,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:01:35,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:35,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:01:35,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:01:35,915 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-14 07:01:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:36,082 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-07-14 07:01:36,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:01:36,084 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-14 07:01:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:36,094 INFO L225 Difference]: With dead ends: 141 [2022-07-14 07:01:36,095 INFO L226 Difference]: Without dead ends: 136 [2022-07-14 07:01:36,097 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-14 07:01:36,100 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-14 07:01:36,101 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-14 07:01:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-14 07:01:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 77. [2022-07-14 07:01:36,138 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-14 07:01:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2022-07-14 07:01:36,143 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 5 [2022-07-14 07:01:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:36,143 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2022-07-14 07:01:36,144 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-14 07:01:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2022-07-14 07:01:36,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 07:01:36,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:36,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 07:01:36,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 07:01:36,146 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-14 07:01:36,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:36,147 INFO L85 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2022-07-14 07:01:36,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:36,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776809337] [2022-07-14 07:01:36,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:36,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:36,200 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-14 07:01:36,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:36,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776809337] [2022-07-14 07:01:36,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776809337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:01:36,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:01:36,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:01:36,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445291548] [2022-07-14 07:01:36,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:01:36,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:01:36,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:36,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:01:36,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:01:36,208 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-14 07:01:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:36,287 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2022-07-14 07:01:36,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:01:36,288 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-14 07:01:36,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:36,291 INFO L225 Difference]: With dead ends: 131 [2022-07-14 07:01:36,291 INFO L226 Difference]: Without dead ends: 131 [2022-07-14 07:01:36,296 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-14 07:01:36,298 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-14 07:01:36,298 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-14 07:01:36,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-14 07:01:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 72. [2022-07-14 07:01:36,304 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-14 07:01:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2022-07-14 07:01:36,305 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 5 [2022-07-14 07:01:36,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:36,305 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2022-07-14 07:01:36,306 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-14 07:01:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-07-14 07:01:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 07:01:36,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:36,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 07:01:36,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 07:01:36,307 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-14 07:01:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:36,309 INFO L85 PathProgramCache]: Analyzing trace with hash 889665583, now seen corresponding path program 1 times [2022-07-14 07:01:36,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:36,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843257838] [2022-07-14 07:01:36,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:36,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:36,359 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-14 07:01:36,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:36,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843257838] [2022-07-14 07:01:36,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843257838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:01:36,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:01:36,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:01:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416463212] [2022-07-14 07:01:36,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:01:36,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:01:36,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:36,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:01:36,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:01:36,364 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-14 07:01:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:36,379 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-07-14 07:01:36,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:01:36,380 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-14 07:01:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:36,380 INFO L225 Difference]: With dead ends: 84 [2022-07-14 07:01:36,381 INFO L226 Difference]: Without dead ends: 84 [2022-07-14 07:01:36,381 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-14 07:01:36,384 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-14 07:01:36,387 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-14 07:01:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-14 07:01:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2022-07-14 07:01:36,394 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-14 07:01:36,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2022-07-14 07:01:36,399 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 6 [2022-07-14 07:01:36,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:36,399 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2022-07-14 07:01:36,399 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-14 07:01:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2022-07-14 07:01:36,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 07:01:36,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:36,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:01:36,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 07:01:36,401 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-14 07:01:36,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1228392914, now seen corresponding path program 1 times [2022-07-14 07:01:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:36,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924709020] [2022-07-14 07:01:36,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:36,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:36,489 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-14 07:01:36,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:36,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924709020] [2022-07-14 07:01:36,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924709020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:01:36,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:01:36,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:01:36,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49709096] [2022-07-14 07:01:36,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:01:36,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:01:36,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:36,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:01:36,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:01:36,492 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-14 07:01:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:36,504 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-07-14 07:01:36,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:01:36,505 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-14 07:01:36,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:36,505 INFO L225 Difference]: With dead ends: 81 [2022-07-14 07:01:36,505 INFO L226 Difference]: Without dead ends: 81 [2022-07-14 07:01:36,506 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-14 07:01:36,506 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-14 07:01:36,507 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-14 07:01:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-14 07:01:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-07-14 07:01:36,514 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-14 07:01:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-07-14 07:01:36,515 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 11 [2022-07-14 07:01:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:36,515 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-07-14 07:01:36,516 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-14 07:01:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-07-14 07:01:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 07:01:36,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:36,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:01:36,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 07:01:36,517 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-14 07:01:36,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:36,518 INFO L85 PathProgramCache]: Analyzing trace with hash -91353250, now seen corresponding path program 1 times [2022-07-14 07:01:36,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:36,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857759680] [2022-07-14 07:01:36,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:36,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:36,608 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-14 07:01:36,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:36,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857759680] [2022-07-14 07:01:36,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857759680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:01:36,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:01:36,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:01:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852815126] [2022-07-14 07:01:36,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:01:36,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:01:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:36,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:01:36,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:01:36,611 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-14 07:01:36,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:36,783 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-07-14 07:01:36,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:01:36,784 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-14 07:01:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:36,785 INFO L225 Difference]: With dead ends: 101 [2022-07-14 07:01:36,785 INFO L226 Difference]: Without dead ends: 101 [2022-07-14 07:01:36,786 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-14 07:01:36,787 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-14 07:01:36,788 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-14 07:01:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-14 07:01:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2022-07-14 07:01:36,801 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-14 07:01:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-07-14 07:01:36,802 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 15 [2022-07-14 07:01:36,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:36,805 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-07-14 07:01:36,805 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-14 07:01:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-07-14 07:01:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 07:01:36,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:36,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:01:36,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 07:01:36,807 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-14 07:01:36,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:36,812 INFO L85 PathProgramCache]: Analyzing trace with hash -91353249, now seen corresponding path program 1 times [2022-07-14 07:01:36,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:36,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347995589] [2022-07-14 07:01:36,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:36,889 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-14 07:01:36,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:36,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347995589] [2022-07-14 07:01:36,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347995589] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:36,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911023838] [2022-07-14 07:01:36,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:36,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:01:36,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:01:36,899 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-14 07:01:36,926 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-14 07:01:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:36,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 07:01:36,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:37,024 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-14 07:01:37,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:37,053 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-14 07:01:37,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911023838] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:01:37,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:01:37,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-14 07:01:37,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450614222] [2022-07-14 07:01:37,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:37,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:01:37,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:37,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:01:37,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:01:37,056 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-14 07:01:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:37,071 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2022-07-14 07:01:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:01:37,072 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-14 07:01:37,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:37,072 INFO L225 Difference]: With dead ends: 98 [2022-07-14 07:01:37,072 INFO L226 Difference]: Without dead ends: 98 [2022-07-14 07:01:37,073 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-14 07:01:37,074 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-14 07:01:37,074 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-14 07:01:37,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-14 07:01:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-07-14 07:01:37,077 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-14 07:01:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2022-07-14 07:01:37,078 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 15 [2022-07-14 07:01:37,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:37,078 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2022-07-14 07:01:37,079 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-14 07:01:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-07-14 07:01:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 07:01:37,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:37,080 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 07:01:37,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 07:01:37,303 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-14 07:01:37,304 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-14 07:01:37,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:37,305 INFO L85 PathProgramCache]: Analyzing trace with hash 965941252, now seen corresponding path program 1 times [2022-07-14 07:01:37,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:37,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949040727] [2022-07-14 07:01:37,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:37,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:37,433 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-14 07:01:37,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:37,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949040727] [2022-07-14 07:01:37,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949040727] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:37,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984602774] [2022-07-14 07:01:37,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:37,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:01:37,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:01:37,436 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-14 07:01:37,437 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-14 07:01:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:37,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 07:01:37,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:37,593 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-14 07:01:37,598 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-14 07:01:37,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:37,702 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-14 07:01:37,712 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 07:01:37,713 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-14 07:01:37,754 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-14 07:01:37,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:38,068 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-14 07:01:38,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984602774] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:01:38,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:01:38,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2022-07-14 07:01:38,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889113240] [2022-07-14 07:01:38,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:38,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 07:01:38,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:38,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 07:01:38,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-14 07:01:38,071 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-14 07:01:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:38,236 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2022-07-14 07:01:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:01:38,236 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-14 07:01:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:38,237 INFO L225 Difference]: With dead ends: 120 [2022-07-14 07:01:38,237 INFO L226 Difference]: Without dead ends: 120 [2022-07-14 07:01:38,238 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-14 07:01:38,238 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-14 07:01:38,239 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-14 07:01:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-14 07:01:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 95. [2022-07-14 07:01:38,242 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-14 07:01:38,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-07-14 07:01:38,243 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 20 [2022-07-14 07:01:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:38,243 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-07-14 07:01:38,243 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-14 07:01:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-07-14 07:01:38,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 07:01:38,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:38,244 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-07-14 07:01:38,271 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-14 07:01:38,459 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-14 07:01:38,460 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-14 07:01:38,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:38,460 INFO L85 PathProgramCache]: Analyzing trace with hash -671675920, now seen corresponding path program 2 times [2022-07-14 07:01:38,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:38,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243808587] [2022-07-14 07:01:38,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:38,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:38,525 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-14 07:01:38,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:38,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243808587] [2022-07-14 07:01:38,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243808587] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:38,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254020068] [2022-07-14 07:01:38,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:01:38,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:01:38,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:01:38,528 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-14 07:01:38,552 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-14 07:01:38,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 07:01:38,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:01:38,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 07:01:38,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:38,753 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-14 07:01:38,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:38,803 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-14 07:01:38,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254020068] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:01:38,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:01:38,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2022-07-14 07:01:38,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152985574] [2022-07-14 07:01:38,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:38,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 07:01:38,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:38,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 07:01:38,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:01:38,806 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-14 07:01:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:38,928 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-07-14 07:01:38,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 07:01:38,929 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-14 07:01:38,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:38,929 INFO L225 Difference]: With dead ends: 105 [2022-07-14 07:01:38,930 INFO L226 Difference]: Without dead ends: 105 [2022-07-14 07:01:38,930 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-14 07:01:38,931 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-14 07:01:38,931 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-14 07:01:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-14 07:01:38,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-14 07:01:38,934 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-14 07:01:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2022-07-14 07:01:38,934 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 42 [2022-07-14 07:01:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:38,935 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2022-07-14 07:01:38,935 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-14 07:01:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2022-07-14 07:01:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 07:01:38,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:38,936 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:01:38,964 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-14 07:01:39,161 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-14 07:01:39,161 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-14 07:01:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:39,162 INFO L85 PathProgramCache]: Analyzing trace with hash -719682373, now seen corresponding path program 1 times [2022-07-14 07:01:39,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:39,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470322770] [2022-07-14 07:01:39,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:39,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:39,290 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-14 07:01:39,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:39,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470322770] [2022-07-14 07:01:39,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470322770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:01:39,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:01:39,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:01:39,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17855489] [2022-07-14 07:01:39,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:01:39,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:01:39,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:39,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:01:39,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:01:39,293 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-14 07:01:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:39,446 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2022-07-14 07:01:39,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:01:39,447 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-14 07:01:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:39,448 INFO L225 Difference]: With dead ends: 140 [2022-07-14 07:01:39,448 INFO L226 Difference]: Without dead ends: 140 [2022-07-14 07:01:39,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:01:39,449 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-14 07:01:39,449 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-14 07:01:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-14 07:01:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 131. [2022-07-14 07:01:39,451 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-14 07:01:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2022-07-14 07:01:39,452 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 55 [2022-07-14 07:01:39,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:39,453 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2022-07-14 07:01:39,453 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-14 07:01:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2022-07-14 07:01:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 07:01:39,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:39,455 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-14 07:01:39,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 07:01:39,455 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-14 07:01:39,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:39,456 INFO L85 PathProgramCache]: Analyzing trace with hash 109308747, now seen corresponding path program 1 times [2022-07-14 07:01:39,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:39,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654832421] [2022-07-14 07:01:39,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:39,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:39,566 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-14 07:01:39,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:39,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654832421] [2022-07-14 07:01:39,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654832421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:01:39,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:01:39,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 07:01:39,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449458889] [2022-07-14 07:01:39,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:01:39,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:01:39,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:39,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:01:39,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:01:39,568 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-14 07:01:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:39,666 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2022-07-14 07:01:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:01:39,667 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-14 07:01:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:39,668 INFO L225 Difference]: With dead ends: 137 [2022-07-14 07:01:39,668 INFO L226 Difference]: Without dead ends: 137 [2022-07-14 07:01:39,668 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-14 07:01:39,669 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 328 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 07:01:39,669 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-14 07:01:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-14 07:01:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2022-07-14 07:01:39,672 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-14 07:01:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2022-07-14 07:01:39,672 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 59 [2022-07-14 07:01:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:39,673 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2022-07-14 07:01:39,673 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-14 07:01:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2022-07-14 07:01:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-14 07:01:39,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:39,674 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-14 07:01:39,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 07:01:39,674 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-14 07:01:39,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1929263777, now seen corresponding path program 1 times [2022-07-14 07:01:39,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:39,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083586348] [2022-07-14 07:01:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:39,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:39,921 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-14 07:01:39,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:39,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083586348] [2022-07-14 07:01:39,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083586348] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:39,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869870364] [2022-07-14 07:01:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:39,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:01:39,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:01:39,923 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-14 07:01:39,952 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-14 07:01:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:40,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-14 07:01:40,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:40,134 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-14 07:01:40,153 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 07:01:40,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 07:01:40,173 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-14 07:01:40,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:40,195 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-14 07:01:40,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:40,210 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-14 07:01:40,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:40,222 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-14 07:01:40,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:40,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 07:01:40,245 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-14 07:01:40,328 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-14 07:01:40,331 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-14 07:01:40,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:40,352 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-14 07:01:40,378 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-14 07:01:40,384 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-14 07:01:40,390 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-14 07:01:40,414 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-14 07:01:40,474 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-14 07:01:40,474 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-14 07:01:40,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 30 treesize of output 22 [2022-07-14 07:01:40,508 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-14 07:01:40,549 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-14 07:01:40,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869870364] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:01:40,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:01:40,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 16] total 25 [2022-07-14 07:01:40,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799907728] [2022-07-14 07:01:40,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:40,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-14 07:01:40,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:40,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 07:01:40,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=334, Unknown=5, NotChecked=200, Total=600 [2022-07-14 07:01:40,551 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-14 07:01:41,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:41,099 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2022-07-14 07:01:41,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 07:01:41,099 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-14 07:01:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:41,100 INFO L225 Difference]: With dead ends: 162 [2022-07-14 07:01:41,100 INFO L226 Difference]: Without dead ends: 162 [2022-07-14 07:01:41,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=927, Unknown=5, NotChecked=350, Total=1560 [2022-07-14 07:01:41,101 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 648 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-14 07:01:41,102 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-14 07:01:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-14 07:01:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 131. [2022-07-14 07:01:41,104 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-14 07:01:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2022-07-14 07:01:41,104 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 63 [2022-07-14 07:01:41,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:41,104 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2022-07-14 07:01:41,105 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-14 07:01:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2022-07-14 07:01:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-14 07:01:41,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:41,106 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-14 07:01:41,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-14 07:01:41,315 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-14 07:01:41,315 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-14 07:01:41,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:41,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1264795644, now seen corresponding path program 1 times [2022-07-14 07:01:41,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:41,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925819174] [2022-07-14 07:01:41,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:41,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:41,594 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-14 07:01:41,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:41,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925819174] [2022-07-14 07:01:41,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925819174] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:41,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193930076] [2022-07-14 07:01:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:41,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:01:41,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:01:41,596 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-14 07:01:41,622 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-14 07:01:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:41,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-14 07:01:41,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:41,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 07:01:41,846 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 07:01:41,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 07:01:41,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 07:01:41,895 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-14 07:01:41,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 07:01:41,916 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-14 07:01:41,916 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-14 07:01:41,931 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-14 07:01:41,932 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-14 07:01:41,958 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-14 07:01:42,023 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-14 07:01:42,028 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-14 07:01:42,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:42,058 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-14 07:01:42,066 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-14 07:01:42,072 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-14 07:01:42,081 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-14 07:01:42,125 INFO L356 Elim1Store]: treesize reduction 191, result has 17.7 percent of original size [2022-07-14 07:01:42,125 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-14 07:01:42,128 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-14 07:01:42,172 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-14 07:01:42,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193930076] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:01:42,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:01:42,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 26 [2022-07-14 07:01:42,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745085246] [2022-07-14 07:01:42,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:42,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 07:01:42,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:42,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 07:01:42,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=408, Unknown=4, NotChecked=172, Total=650 [2022-07-14 07:01:42,174 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-14 07:01:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:42,784 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2022-07-14 07:01:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 07:01:42,785 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-14 07:01:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:42,786 INFO L225 Difference]: With dead ends: 162 [2022-07-14 07:01:42,786 INFO L226 Difference]: Without dead ends: 162 [2022-07-14 07:01:42,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=297, Invalid=975, Unknown=4, NotChecked=284, Total=1560 [2022-07-14 07:01:42,787 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 783 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-14 07:01:42,787 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-14 07:01:42,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-14 07:01:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 131. [2022-07-14 07:01:42,789 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-14 07:01:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2022-07-14 07:01:42,789 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 65 [2022-07-14 07:01:42,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:42,790 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2022-07-14 07:01:42,790 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-14 07:01:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2022-07-14 07:01:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-14 07:01:42,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:42,791 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-14 07:01:42,833 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-14 07:01:43,017 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-14 07:01:43,018 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-14 07:01:43,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:43,018 INFO L85 PathProgramCache]: Analyzing trace with hash -892543400, now seen corresponding path program 1 times [2022-07-14 07:01:43,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:43,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267888081] [2022-07-14 07:01:43,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:43,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:43,207 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-14 07:01:43,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:43,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267888081] [2022-07-14 07:01:43,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267888081] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:43,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022025404] [2022-07-14 07:01:43,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:43,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:01:43,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:01:43,210 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-14 07:01:43,213 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-14 07:01:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:43,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-14 07:01:43,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:43,438 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-14 07:01:43,486 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 07:01:43,490 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-14 07:01:43,529 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-14 07:01:43,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:43,558 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-14 07:01:43,587 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 07:01:43,588 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-14 07:01:43,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:43,690 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-14 07:01:43,761 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-14 07:01:43,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:44,023 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~head~1#1.offset_34| Int) (v_ArrVal_2024 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_34|) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2024) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_34| 4)) 0)) (and (<= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0) (not (= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0))))) is different from false [2022-07-14 07:01:44,069 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 Int) (|v_ULTIMATE.start_main_~head~1#1.offset_34| Int) (v_ArrVal_2024 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_34|) (not (= (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_2023)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2024) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_34| 4)) 0)) (and (<= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0) (not (= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0))))) is different from false [2022-07-14 07:01:44,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:01:44,082 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:44,083 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 28 treesize of output 34 [2022-07-14 07:01:44,090 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:44,090 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 39 treesize of output 39 [2022-07-14 07:01:44,094 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 22 treesize of output 18 [2022-07-14 07:01:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2022-07-14 07:01:44,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022025404] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:01:44,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:01:44,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2022-07-14 07:01:44,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92876820] [2022-07-14 07:01:44,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:44,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-14 07:01:44,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-14 07:01:44,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=794, Unknown=2, NotChecked=114, Total=992 [2022-07-14 07:01:44,395 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-14 07:01:44,929 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |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_$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|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_2023 Int) (|v_ULTIMATE.start_main_~head~1#1.offset_34| Int) (v_ArrVal_2024 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_34|) (not (= (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_2023)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2024) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_34| 4)) 0)) (and (<= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0) (not (= |v_ULTIMATE.start_main_~head~1#1.offset_34| 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-14 07:01:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:45,434 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2022-07-14 07:01:45,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 07:01:45,440 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-14 07:01:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:45,440 INFO L225 Difference]: With dead ends: 149 [2022-07-14 07:01:45,441 INFO L226 Difference]: Without dead ends: 145 [2022-07-14 07:01:45,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=347, Invalid=1824, Unknown=3, NotChecked=276, Total=2450 [2022-07-14 07:01:45,444 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 515 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 317 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 07:01:45,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 737 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 587 Invalid, 0 Unknown, 317 Unchecked, 0.3s Time] [2022-07-14 07:01:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-14 07:01:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 117. [2022-07-14 07:01:45,452 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-14 07:01:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2022-07-14 07:01:45,452 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 66 [2022-07-14 07:01:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:45,453 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2022-07-14 07:01:45,455 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-14 07:01:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2022-07-14 07:01:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 07:01:45,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:45,458 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-14 07:01:45,486 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-14 07:01:45,679 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-14 07:01:45,680 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-14 07:01:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:45,680 INFO L85 PathProgramCache]: Analyzing trace with hash 8707913, now seen corresponding path program 1 times [2022-07-14 07:01:45,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:45,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599287897] [2022-07-14 07:01:45,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:45,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:45,896 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-14 07:01:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:45,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599287897] [2022-07-14 07:01:45,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599287897] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:45,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697857225] [2022-07-14 07:01:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:45,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:01:45,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:01:45,898 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-14 07:01:45,909 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-14 07:01:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:46,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-14 07:01:46,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:46,152 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-14 07:01:46,167 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 07:01:46,168 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-14 07:01:46,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, 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-14 07:01:46,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:46,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-14 07:01:46,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:46,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 07:01:46,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 07:01:46,362 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-14 07:01:46,366 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-14 07:01:46,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:46,573 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-14 07:01:46,591 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-14 07:01:46,602 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-14 07:01:46,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:01:46,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:01:46,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:01:46,615 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:46,615 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-14 07:01:46,624 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:46,624 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-14 07:01:46,629 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-14 07:01:46,724 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-14 07:01:46,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697857225] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:01:46,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:01:46,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 30 [2022-07-14 07:01:46,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392665281] [2022-07-14 07:01:46,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:46,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-14 07:01:46,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:46,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-14 07:01:46,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=621, Unknown=3, NotChecked=156, Total=870 [2022-07-14 07:01:46,725 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-14 07:01:47,219 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) (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 |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-14 07:01:47,562 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-14 07:01:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:47,851 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2022-07-14 07:01:47,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 07:01:47,852 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-14 07:01:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:47,853 INFO L225 Difference]: With dead ends: 143 [2022-07-14 07:01:47,853 INFO L226 Difference]: Without dead ends: 143 [2022-07-14 07:01:47,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=297, Invalid=1277, Unknown=6, NotChecked=400, Total=1980 [2022-07-14 07:01:47,855 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 312 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:01:47,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 656 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 255 Invalid, 0 Unknown, 331 Unchecked, 0.1s Time] [2022-07-14 07:01:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-14 07:01:47,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 117. [2022-07-14 07:01:47,859 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-14 07:01:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2022-07-14 07:01:47,859 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 67 [2022-07-14 07:01:47,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:47,859 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2022-07-14 07:01:47,860 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-14 07:01:47,860 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2022-07-14 07:01:47,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-14 07:01:47,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:47,860 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-14 07:01:47,888 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-14 07:01:48,075 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-14 07:01:48,076 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-14 07:01:48,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:48,076 INFO L85 PathProgramCache]: Analyzing trace with hash -221625277, now seen corresponding path program 1 times [2022-07-14 07:01:48,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:48,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641415240] [2022-07-14 07:01:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:48,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:48,290 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-14 07:01:48,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:48,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641415240] [2022-07-14 07:01:48,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641415240] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:48,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715240765] [2022-07-14 07:01:48,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:48,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:01:48,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:01:48,293 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-14 07:01:48,324 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-14 07:01:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:48,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-14 07:01:48,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:48,577 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-14 07:01:48,594 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 07:01:48,594 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-14 07:01:48,619 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-14 07:01:48,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:48,638 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-14 07:01:48,656 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 07:01:48,657 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-14 07:01:48,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:01:48,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:48,900 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-14 07:01:48,904 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-14 07:01:48,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:49,103 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-07-14 07:01:49,104 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-14 07:01:49,110 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-14 07:01:49,124 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-14 07:01:49,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:01:49,145 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:49,145 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-14 07:01:49,154 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:49,154 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-14 07:01:49,159 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-14 07:01:49,267 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-14 07:01:49,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715240765] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:01:49,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:01:49,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 29 [2022-07-14 07:01:49,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205688045] [2022-07-14 07:01:49,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:49,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-14 07:01:49,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:49,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-14 07:01:49,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=677, Unknown=2, NotChecked=106, Total=870 [2022-07-14 07:01:49,269 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-14 07:01:49,689 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (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)))) (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (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) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |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) (= (select |c_#valid| .cse0) 1))) is different from false [2022-07-14 07:01:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:49,949 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2022-07-14 07:01:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 07:01:49,950 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-14 07:01:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:49,951 INFO L225 Difference]: With dead ends: 124 [2022-07-14 07:01:49,951 INFO L226 Difference]: Without dead ends: 124 [2022-07-14 07:01:49,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=1046, Unknown=3, NotChecked=204, Total=1406 [2022-07-14 07:01:49,952 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 73 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 338 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:01:49,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 795 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 509 Invalid, 0 Unknown, 338 Unchecked, 0.2s Time] [2022-07-14 07:01:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-14 07:01:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2022-07-14 07:01:49,957 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-14 07:01:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2022-07-14 07:01:49,957 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 69 [2022-07-14 07:01:49,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:49,958 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2022-07-14 07:01:49,958 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-14 07:01:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2022-07-14 07:01:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-14 07:01:49,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:49,958 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-14 07:01:49,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-14 07:01:50,163 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-14 07:01:50,164 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-14 07:01:50,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:50,164 INFO L85 PathProgramCache]: Analyzing trace with hash -221625276, now seen corresponding path program 1 times [2022-07-14 07:01:50,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:50,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812932443] [2022-07-14 07:01:50,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:50,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:50,519 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-14 07:01:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:50,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812932443] [2022-07-14 07:01:50,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812932443] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:50,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903363255] [2022-07-14 07:01:50,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:50,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:01:50,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:01:50,522 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-14 07:01:50,523 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-14 07:01:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:50,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-14 07:01:50,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:50,778 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-14 07:01:50,837 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 07:01:50,838 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-14 07:01:50,865 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-14 07:01:50,871 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-14 07:01:50,897 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-14 07:01:50,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 07:01:50,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:50,909 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-14 07:01:50,930 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 07:01:50,931 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-14 07:01:50,934 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-14 07:01:51,109 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-14 07:01:51,112 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-14 07:01:51,155 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-14 07:01:51,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:51,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:51,397 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 48 treesize of output 52 [2022-07-14 07:01:51,432 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-14 07:01:51,449 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-14 07:01:51,465 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-14 07:01:51,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2022-07-14 07:01:51,467 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-14 07:01:51,470 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-14 07:01:51,475 INFO L356 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2022-07-14 07:01:51,475 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-14 07:01:51,486 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-14 07:01:51,486 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-14 07:01:51,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:01:51,490 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-14 07:01:51,676 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-14 07:01:51,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903363255] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:01:51,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:01:51,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 35 [2022-07-14 07:01:51,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85168410] [2022-07-14 07:01:51,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:51,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-14 07:01:51,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:51,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-14 07:01:51,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1022, Unknown=2, NotChecked=130, Total=1260 [2022-07-14 07:01:51,679 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-14 07:01:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:53,300 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2022-07-14 07:01:53,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 07:01:53,301 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-14 07:01:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:53,302 INFO L225 Difference]: With dead ends: 178 [2022-07-14 07:01:53,302 INFO L226 Difference]: Without dead ends: 178 [2022-07-14 07:01:53,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=487, Invalid=2068, Unknown=3, NotChecked=198, Total=2756 [2022-07-14 07:01:53,303 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1541 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 07:01:53,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 418 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 710 Invalid, 0 Unknown, 314 Unchecked, 0.4s Time] [2022-07-14 07:01:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-14 07:01:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 141. [2022-07-14 07:01:53,306 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-14 07:01:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 157 transitions. [2022-07-14 07:01:53,307 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 157 transitions. Word has length 69 [2022-07-14 07:01:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:53,307 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 157 transitions. [2022-07-14 07:01:53,308 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-14 07:01:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 157 transitions. [2022-07-14 07:01:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-14 07:01:53,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:53,308 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-14 07:01:53,330 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-14 07:01:53,519 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-14 07:01:53,519 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-14 07:01:53,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:53,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1069989460, now seen corresponding path program 1 times [2022-07-14 07:01:53,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:53,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724570415] [2022-07-14 07:01:53,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:53,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:53,604 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-14 07:01:53,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:53,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724570415] [2022-07-14 07:01:53,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724570415] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:53,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415260145] [2022-07-14 07:01:53,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:53,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:01:53,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:01:53,607 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-14 07:01:53,639 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-14 07:01:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:53,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 07:01:53,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:54,010 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-14 07:01:54,012 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-14 07:01:54,041 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-14 07:01:54,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:54,121 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-14 07:01:54,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415260145] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:01:54,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:01:54,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 10 [2022-07-14 07:01:54,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038502540] [2022-07-14 07:01:54,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:54,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 07:01:54,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:01:54,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 07:01:54,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-14 07:01:54,123 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-14 07:01:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:54,283 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2022-07-14 07:01:54,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 07:01:54,283 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-14 07:01:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:54,284 INFO L225 Difference]: With dead ends: 144 [2022-07-14 07:01:54,284 INFO L226 Difference]: Without dead ends: 144 [2022-07-14 07:01:54,285 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-14 07:01:54,285 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-14 07:01:54,285 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-14 07:01:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-14 07:01:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-07-14 07:01:54,287 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-14 07:01:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2022-07-14 07:01:54,288 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 73 [2022-07-14 07:01:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:54,288 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2022-07-14 07:01:54,288 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-14 07:01:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2022-07-14 07:01:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-14 07:01:54,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:54,289 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-14 07:01:54,316 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-14 07:01:54,489 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-14 07:01:54,489 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-14 07:01:54,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:54,490 INFO L85 PathProgramCache]: Analyzing trace with hash -215880728, now seen corresponding path program 1 times [2022-07-14 07:01:54,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:01:54,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487782988] [2022-07-14 07:01:54,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:01:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:54,886 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-14 07:01:54,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:01:54,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487782988] [2022-07-14 07:01:54,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487782988] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:54,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480804468] [2022-07-14 07:01:54,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:54,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:01:54,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:01:54,887 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-14 07:01:54,888 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-14 07:01:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:55,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-14 07:01:55,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:55,215 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-14 07:01:55,238 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 07:01:55,238 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-14 07:01:55,287 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-14 07:01:55,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:55,317 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-14 07:01:55,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:55,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:55,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:55,361 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-14 07:01:55,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:55,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:55,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:55,379 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-14 07:01:55,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:55,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:55,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:55,399 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-14 07:01:55,417 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-14 07:01:55,506 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 07:01:55,506 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-14 07:01:55,549 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-14 07:01:55,563 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-14 07:01:55,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 21 treesize of output 21 [2022-07-14 07:01:55,595 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-14 07:01:55,599 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-14 07:01:55,608 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-14 07:01:55,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 21 treesize of output 21 [2022-07-14 07:01:55,657 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-14 07:01:55,658 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-14 07:01:55,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:55,664 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-14 07:01:55,692 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 07:01:55,692 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-14 07:01:55,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:55,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:55,699 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-14 07:01:55,702 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-14 07:01:55,945 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-14 07:01:55,949 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-14 07:01:56,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:56,020 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-14 07:01:56,022 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-14 07:01:56,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:56,141 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-14 07:01:56,157 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-14 07:01:56,174 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-14 07:01:56,174 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-14 07:01:56,176 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-14 07:01:56,180 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-14 07:01:56,192 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-14 07:01:56,192 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-14 07:01:56,195 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-14 07:01:56,197 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-14 07:01:56,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_95 Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3929 Int) (v_arrayElimCell_97 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3920))) (let ((.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and (= 0 (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)) (not .cse1)) (and .cse1 (= (select (select (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3929)) v_arrayElimCell_95) v_arrayElimCell_97) 0)))))) is different from false [2022-07-14 07:01:56,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3920 (Array Int Int))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and (= 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|)) (not .cse0)) (and .cse0 (forall ((v_arrayElimCell_95 Int) (v_ArrVal_3929 Int) (v_arrayElimCell_97 Int)) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3920))) (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| (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))) v_arrayElimCell_95) v_arrayElimCell_97) 0)))))) is different from false [2022-07-14 07:01:56,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:56,451 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-14 07:01:56,600 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:56,600 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-14 07:01:56,613 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))) (let ((.cse0 (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (and .cse0 (forall ((v_arrayElimCell_95 Int) (v_ArrVal_3929 Int) (v_arrayElimCell_97 Int)) (= (select (select (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43| v_ArrVal_3920))) (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3929))) v_arrayElimCell_95) v_arrayElimCell_97) 0))) (and (= (select (select (store |c_#memory_int| |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 .cse0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43|) 0))))) is different from false [2022-07-14 07:01:56,677 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:56,678 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 18 treesize of output 22 [2022-07-14 07:01:56,755 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))) (let ((.cse0 (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_43|) 0)) (and .cse0 (forall ((v_arrayElimCell_95 Int) (v_ArrVal_3929 Int) (v_arrayElimCell_97 Int)) (= (select (select (let ((.cse1 (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))) (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3929))) v_arrayElimCell_95) v_arrayElimCell_97) 0))) (and (= (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) (not .cse0))))) is different from false [2022-07-14 07:01:56,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:56,818 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 18 treesize of output 22 [2022-07-14 07:01:57,026 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:57,027 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 28 treesize of output 32 [2022-07-14 07:01:57,346 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:57,347 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 33 treesize of output 37 [2022-07-14 07:01:57,847 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:57,847 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 38 treesize of output 42 [2022-07-14 07:01:58,433 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:58,433 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 43 treesize of output 47 [2022-07-14 07:01:58,658 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-14 07:01:58,658 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 136 treesize of output 100 [2022-07-14 07:01:58,671 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:58,672 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 676 treesize of output 656 [2022-07-14 07:01:58,687 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:58,688 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 704 treesize of output 694 [2022-07-14 07:01:58,705 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:58,705 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 790 treesize of output 762 [2022-07-14 07:02:05,416 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-14 07:02:05,439 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 07:02:05,439 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 15 treesize of output 9 [2022-07-14 07:02:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 65 proven. 8 refuted. 5 times theorem prover too weak. 11 trivial. 20 not checked. [2022-07-14 07:02:05,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480804468] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:02:05,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:02:05,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 24] total 52 [2022-07-14 07:02:05,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011574158] [2022-07-14 07:02:05,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:02:05,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-14 07:02:05,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:02:05,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-14 07:02:05,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1872, Unknown=32, NotChecked=558, Total=2652 [2022-07-14 07:02:05,614 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 52 states, 52 states have (on average 3.173076923076923) internal successors, (165), 52 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-14 07:02:06,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:02:06,961 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2022-07-14 07:02:06,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 07:02:06,962 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.173076923076923) internal successors, (165), 52 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-14 07:02:06,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:02:06,962 INFO L225 Difference]: With dead ends: 150 [2022-07-14 07:02:06,963 INFO L226 Difference]: Without dead ends: 150 [2022-07-14 07:02:06,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 133 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=425, Invalid=3347, Unknown=34, NotChecked=750, Total=4556 [2022-07-14 07:02:06,964 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 314 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 791 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 07:02:06,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 979 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 832 Invalid, 0 Unknown, 791 Unchecked, 0.4s Time] [2022-07-14 07:02:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-14 07:02:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2022-07-14 07:02:06,967 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-14 07:02:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2022-07-14 07:02:06,967 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 77 [2022-07-14 07:02:06,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:02:06,968 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2022-07-14 07:02:06,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.173076923076923) internal successors, (165), 52 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-14 07:02:06,968 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2022-07-14 07:02:06,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-14 07:02:06,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:02:06,969 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-14 07:02:06,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-14 07:02:07,175 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-14 07:02:07,176 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-14 07:02:07,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:02:07,176 INFO L85 PathProgramCache]: Analyzing trace with hash 323840077, now seen corresponding path program 1 times [2022-07-14 07:02:07,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:02:07,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786780361] [2022-07-14 07:02:07,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:02:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:02:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:02:07,666 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-14 07:02:07,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:02:07,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786780361] [2022-07-14 07:02:07,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786780361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:02:07,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605041406] [2022-07-14 07:02:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:02:07,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:02:07,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:02:07,668 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-14 07:02:07,669 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-14 07:02:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:02:08,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-14 07:02:08,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:02:08,022 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-14 07:02:08,044 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 07:02:08,045 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-14 07:02:08,086 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-14 07:02:08,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:02:08,119 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-14 07:02:08,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:02:08,128 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-14 07:02:08,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:02:08,138 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-14 07:02:08,151 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-14 07:02:08,216 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 07:02:08,216 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-14 07:02:08,253 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-14 07:02:08,268 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-14 07:02:08,277 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-14 07:02:08,285 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-14 07:02:08,288 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-14 07:02:08,292 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-14 07:02:08,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:02:08,325 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-14 07:02:08,328 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-14 07:02:08,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:02:08,337 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-14 07:02:08,370 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 07:02:08,370 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-14 07:02:08,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:02:08,390 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-14 07:02:08,393 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-14 07:02:08,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:02:08,666 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-14 07:02:08,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:02:08,669 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-14 07:02:08,707 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-14 07:02:08,711 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-14 07:02:08,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:02:08,975 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-14 07:02:08,992 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-14 07:02:09,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:02:09,011 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:09,012 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-14 07:02:09,021 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:09,022 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-14 07:02:09,028 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 57 treesize of output 53 [2022-07-14 07:02:09,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:02:09,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:09,037 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 108 treesize of output 98 [2022-07-14 07:02:09,048 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:09,048 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-14 07:02:09,053 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-14 07:02:09,564 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4323 (Array Int Int)) (v_ArrVal_4325 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_129 Int)) (let ((.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and (= (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))) v_arrayElimCell_129) (+ v_arrayElimCell_132 8)) 0) (not .cse1)) (and .cse1 (forall ((v_arrayElimCell_131 Int) (v_arrayElimCell_134 Int)) (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4323))) (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) v_ArrVal_4325))) v_arrayElimCell_131) (+ v_arrayElimCell_134 8)) 0))) (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= v_arrayElimCell_129 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_132))))))) is different from false [2022-07-14 07:02:11,056 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:11,056 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-14 07:02:11,162 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:11,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 07:02:11,174 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4323 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_46| Int)) (let ((.cse0 (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_46| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (and .cse0 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4325 Int) (v_arrayElimCell_134 Int)) (= (select (select (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_46| v_ArrVal_4323))) (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_4325))) v_arrayElimCell_131) (+ v_arrayElimCell_134 8)) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_46|) 0)) (and (= (select (select (store |c_#memory_int| |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 .cse0))))) is different from false [2022-07-14 07:02:11,309 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:11,309 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 20 treesize of output 24 [2022-07-14 07:02:11,338 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4323 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_46| Int) (v_ArrVal_4309 (Array Int Int))) (let ((.cse0 (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_46| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_46|) 0)) (and .cse0 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_4325 Int) (v_arrayElimCell_134 Int)) (= (select (select (let ((.cse1 (store (store |c_#memory_int| |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))) (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_4325))) v_arrayElimCell_131) (+ v_arrayElimCell_134 8)) 0))) (and (= (select (select (store (store |c_#memory_int| |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 .cse0))))) is different from false [2022-07-14 07:02:11,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:11,422 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 20 treesize of output 24 [2022-07-14 07:02:11,539 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:11,540 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 30 treesize of output 34 [2022-07-14 07:02:11,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:11,946 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 39 [2022-07-14 07:02:12,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:12,231 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 40 treesize of output 44 [2022-07-14 07:02:12,461 INFO L356 Elim1Store]: treesize reduction 191, result has 17.7 percent of original size [2022-07-14 07:02:12,461 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 131 treesize of output 96 [2022-07-14 07:02:12,485 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:12,486 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 2660 treesize of output 2594 [2022-07-14 07:02:12,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:12,518 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 3106 treesize of output 2854 [2022-07-14 07:02:12,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:12,557 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 3110 treesize of output 2990