./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.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 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 20:48:47,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 20:48:47,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 20:48:47,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 20:48:47,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 20:48:47,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 20:48:47,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 20:48:47,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 20:48:47,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 20:48:47,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 20:48:47,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 20:48:47,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 20:48:47,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 20:48:47,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 20:48:47,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 20:48:47,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 20:48:47,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 20:48:47,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 20:48:47,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 20:48:47,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 20:48:47,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 20:48:47,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 20:48:47,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 20:48:47,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 20:48:47,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 20:48:47,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 20:48:47,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 20:48:47,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 20:48:47,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 20:48:47,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 20:48:47,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 20:48:47,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 20:48:47,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 20:48:47,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 20:48:47,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 20:48:47,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 20:48:47,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 20:48:47,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 20:48:47,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 20:48:47,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 20:48:47,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 20:48:47,857 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 20:48:47,890 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 20:48:47,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 20:48:47,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 20:48:47,891 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 20:48:47,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 20:48:47,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 20:48:47,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 20:48:47,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 20:48:47,893 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 20:48:47,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 20:48:47,894 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 20:48:47,894 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 20:48:47,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 20:48:47,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 20:48:47,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 20:48:47,895 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 20:48:47,895 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 20:48:47,895 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 20:48:47,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 20:48:47,895 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 20:48:47,896 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 20:48:47,896 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 20:48:47,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 20:48:47,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 20:48:47,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 20:48:47,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:48:47,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 20:48:47,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 20:48:47,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 20:48:47,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 20:48:47,898 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 20:48:47,898 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 -> 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 [2021-12-18 20:48:48,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 20:48:48,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 20:48:48,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 20:48:48,150 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 20:48:48,151 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 20:48:48,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2021-12-18 20:48:48,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c76a17a3/1b7d289df90a4b90a106df83f1afd669/FLAGf57b17030 [2021-12-18 20:48:48,647 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 20:48:48,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2021-12-18 20:48:48,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c76a17a3/1b7d289df90a4b90a106df83f1afd669/FLAGf57b17030 [2021-12-18 20:48:48,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c76a17a3/1b7d289df90a4b90a106df83f1afd669 [2021-12-18 20:48:48,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 20:48:48,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 20:48:48,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 20:48:48,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 20:48:48,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 20:48:48,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:48:48" (1/1) ... [2021-12-18 20:48:48,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ddbbd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:48, skipping insertion in model container [2021-12-18 20:48:48,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:48:48" (1/1) ... [2021-12-18 20:48:48,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 20:48:48,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 20:48:48,968 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:48:48,974 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 20:48:49,055 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:48:49,080 INFO L208 MainTranslator]: Completed translation [2021-12-18 20:48:49,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49 WrapperNode [2021-12-18 20:48:49,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 20:48:49,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 20:48:49,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 20:48:49,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 20:48:49,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2021-12-18 20:48:49,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2021-12-18 20:48:49,150 INFO L137 Inliner]: procedures = 125, calls = 94, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 304 [2021-12-18 20:48:49,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 20:48:49,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 20:48:49,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 20:48:49,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 20:48:49,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2021-12-18 20:48:49,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2021-12-18 20:48:49,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2021-12-18 20:48:49,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2021-12-18 20:48:49,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2021-12-18 20:48:49,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2021-12-18 20:48:49,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2021-12-18 20:48:49,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 20:48:49,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 20:48:49,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 20:48:49,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 20:48:49,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2021-12-18 20:48:49,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:48:49,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:48:49,237 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) [2021-12-18 20:48:49,254 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 [2021-12-18 20:48:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 20:48:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 20:48:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 20:48:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 20:48:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 20:48:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 20:48:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 20:48:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 20:48:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 20:48:49,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 20:48:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure append [2021-12-18 20:48:49,275 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2021-12-18 20:48:49,384 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 20:48:49,386 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 20:48:49,936 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 20:48:49,946 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 20:48:49,946 INFO L301 CfgBuilder]: Removed 11 assume(true) statements. [2021-12-18 20:48:49,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:48:49 BoogieIcfgContainer [2021-12-18 20:48:49,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 20:48:49,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 20:48:49,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 20:48:49,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 20:48:49,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:48:48" (1/3) ... [2021-12-18 20:48:49,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a7c23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:48:49, skipping insertion in model container [2021-12-18 20:48:49,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (2/3) ... [2021-12-18 20:48:49,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a7c23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:48:49, skipping insertion in model container [2021-12-18 20:48:49,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:48:49" (3/3) ... [2021-12-18 20:48:49,957 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2021-12-18 20:48:49,961 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 20:48:49,962 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2021-12-18 20:48:49,993 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 20:48:49,999 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 20:48:49,999 INFO L340 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2021-12-18 20:48:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 160 states have (on average 2.1375) internal successors, (342), 309 states have internal predecessors, (342), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-18 20:48:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 20:48:50,023 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:48:50,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 20:48:50,024 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:48:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:48:50,028 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-18 20:48:50,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:48:50,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862603720] [2021-12-18 20:48:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:48:50,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:48:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:48:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:48:50,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:48:50,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862603720] [2021-12-18 20:48:50,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862603720] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:48:50,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:48:50,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:48:50,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150982086] [2021-12-18 20:48:50,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:48:50,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:48:50,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:48:50,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:48:50,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:48:50,217 INFO L87 Difference]: Start difference. First operand has 323 states, 160 states have (on average 2.1375) internal successors, (342), 309 states have internal predecessors, (342), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:48:50,640 INFO L93 Difference]: Finished difference Result 548 states and 601 transitions. [2021-12-18 20:48:50,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:48:50,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-18 20:48:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:48:50,659 INFO L225 Difference]: With dead ends: 548 [2021-12-18 20:48:50,659 INFO L226 Difference]: Without dead ends: 546 [2021-12-18 20:48:50,661 INFO L932 BasicCegarLoop]: 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 [2021-12-18 20:48:50,665 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 246 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:48:50,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 449 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 20:48:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-12-18 20:48:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 407. [2021-12-18 20:48:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 247 states have (on average 2.0890688259109313) internal successors, (516), 393 states have internal predecessors, (516), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-18 20:48:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 544 transitions. [2021-12-18 20:48:50,743 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 544 transitions. Word has length 3 [2021-12-18 20:48:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:48:50,747 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 544 transitions. [2021-12-18 20:48:50,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 544 transitions. [2021-12-18 20:48:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 20:48:50,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:48:50,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 20:48:50,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 20:48:50,749 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:48:50,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:48:50,749 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-18 20:48:50,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:48:50,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915396087] [2021-12-18 20:48:50,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:48:50,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:48:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:48:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:48:50,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:48:50,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915396087] [2021-12-18 20:48:50,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915396087] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:48:50,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:48:50,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:48:50,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999359017] [2021-12-18 20:48:50,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:48:50,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:48:50,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:48:50,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:48:50,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:48:50,786 INFO L87 Difference]: Start difference. First operand 407 states and 544 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:48:50,985 INFO L93 Difference]: Finished difference Result 408 states and 547 transitions. [2021-12-18 20:48:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:48:50,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-18 20:48:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:48:50,988 INFO L225 Difference]: With dead ends: 408 [2021-12-18 20:48:50,989 INFO L226 Difference]: Without dead ends: 408 [2021-12-18 20:48:50,989 INFO L932 BasicCegarLoop]: 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 [2021-12-18 20:48:50,994 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 6 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:48:50,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 567 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:48:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-12-18 20:48:51,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 405. [2021-12-18 20:48:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 247 states have (on average 2.080971659919028) internal successors, (514), 391 states have internal predecessors, (514), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-18 20:48:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 542 transitions. [2021-12-18 20:48:51,023 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 542 transitions. Word has length 3 [2021-12-18 20:48:51,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:48:51,024 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 542 transitions. [2021-12-18 20:48:51,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 542 transitions. [2021-12-18 20:48:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 20:48:51,025 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:48:51,025 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:48:51,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 20:48:51,025 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:48:51,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:48:51,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1117390162, now seen corresponding path program 1 times [2021-12-18 20:48:51,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:48:51,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235114455] [2021-12-18 20:48:51,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:48:51,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:48:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:48:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:48:51,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:48:51,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235114455] [2021-12-18 20:48:51,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235114455] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:48:51,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:48:51,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:48:51,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729069365] [2021-12-18 20:48:51,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:48:51,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:48:51,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:48:51,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:48:51,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:48:51,090 INFO L87 Difference]: Start difference. First operand 405 states and 542 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:48:51,278 INFO L93 Difference]: Finished difference Result 400 states and 537 transitions. [2021-12-18 20:48:51,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:48:51,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-18 20:48:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:48:51,281 INFO L225 Difference]: With dead ends: 400 [2021-12-18 20:48:51,281 INFO L226 Difference]: Without dead ends: 400 [2021-12-18 20:48:51,282 INFO L932 BasicCegarLoop]: 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 [2021-12-18 20:48:51,283 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 43 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:48:51,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 497 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:48:51,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-12-18 20:48:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2021-12-18 20:48:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 247 states have (on average 2.0607287449392713) internal successors, (509), 386 states have internal predecessors, (509), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-18 20:48:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 537 transitions. [2021-12-18 20:48:51,301 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 537 transitions. Word has length 10 [2021-12-18 20:48:51,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:48:51,302 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 537 transitions. [2021-12-18 20:48:51,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 537 transitions. [2021-12-18 20:48:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 20:48:51,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:48:51,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:48:51,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 20:48:51,304 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:48:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:48:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1117390163, now seen corresponding path program 1 times [2021-12-18 20:48:51,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:48:51,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147341378] [2021-12-18 20:48:51,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:48:51,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:48:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:48:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:48:51,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:48:51,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147341378] [2021-12-18 20:48:51,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147341378] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:48:51,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:48:51,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:48:51,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238731619] [2021-12-18 20:48:51,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:48:51,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:48:51,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:48:51,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:48:51,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:48:51,395 INFO L87 Difference]: Start difference. First operand 400 states and 537 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:48:51,557 INFO L93 Difference]: Finished difference Result 395 states and 532 transitions. [2021-12-18 20:48:51,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:48:51,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-18 20:48:51,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:48:51,561 INFO L225 Difference]: With dead ends: 395 [2021-12-18 20:48:51,561 INFO L226 Difference]: Without dead ends: 395 [2021-12-18 20:48:51,562 INFO L932 BasicCegarLoop]: 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 [2021-12-18 20:48:51,563 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 38 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:48:51,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 510 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:48:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-12-18 20:48:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2021-12-18 20:48:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 247 states have (on average 2.0404858299595143) internal successors, (504), 381 states have internal predecessors, (504), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-18 20:48:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 532 transitions. [2021-12-18 20:48:51,573 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 532 transitions. Word has length 10 [2021-12-18 20:48:51,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:48:51,573 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 532 transitions. [2021-12-18 20:48:51,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 532 transitions. [2021-12-18 20:48:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 20:48:51,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:48:51,574 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:48:51,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 20:48:51,575 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:48:51,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:48:51,575 INFO L85 PathProgramCache]: Analyzing trace with hash 279357079, now seen corresponding path program 1 times [2021-12-18 20:48:51,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:48:51,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345196919] [2021-12-18 20:48:51,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:48:51,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:48:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:48:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:48:51,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:48:51,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345196919] [2021-12-18 20:48:51,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345196919] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:48:51,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:48:51,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 20:48:51,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242898588] [2021-12-18 20:48:51,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:48:51,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:48:51,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:48:51,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:48:51,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:48:51,662 INFO L87 Difference]: Start difference. First operand 395 states and 532 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:48:52,139 INFO L93 Difference]: Finished difference Result 523 states and 574 transitions. [2021-12-18 20:48:52,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:48:52,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-18 20:48:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:48:52,142 INFO L225 Difference]: With dead ends: 523 [2021-12-18 20:48:52,142 INFO L226 Difference]: Without dead ends: 523 [2021-12-18 20:48:52,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:48:52,143 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 318 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:48:52,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 806 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 20:48:52,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-12-18 20:48:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 387. [2021-12-18 20:48:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 247 states have (on average 2.0080971659919027) internal successors, (496), 373 states have internal predecessors, (496), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-18 20:48:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 524 transitions. [2021-12-18 20:48:52,154 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 524 transitions. Word has length 11 [2021-12-18 20:48:52,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:48:52,154 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 524 transitions. [2021-12-18 20:48:52,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:52,155 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 524 transitions. [2021-12-18 20:48:52,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 20:48:52,155 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:48:52,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:48:52,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 20:48:52,156 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:48:52,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:48:52,156 INFO L85 PathProgramCache]: Analyzing trace with hash 279357080, now seen corresponding path program 1 times [2021-12-18 20:48:52,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:48:52,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015510525] [2021-12-18 20:48:52,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:48:52,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:48:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:48:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:48:52,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:48:52,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015510525] [2021-12-18 20:48:52,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015510525] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:48:52,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:48:52,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 20:48:52,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667248879] [2021-12-18 20:48:52,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:48:52,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 20:48:52,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:48:52,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 20:48:52,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:48:52,248 INFO L87 Difference]: Start difference. First operand 387 states and 524 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:48:52,828 INFO L93 Difference]: Finished difference Result 513 states and 564 transitions. [2021-12-18 20:48:52,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 20:48:52,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-18 20:48:52,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:48:52,830 INFO L225 Difference]: With dead ends: 513 [2021-12-18 20:48:52,831 INFO L226 Difference]: Without dead ends: 513 [2021-12-18 20:48:52,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:48:52,832 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 809 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 20:48:52,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [809 Valid, 598 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-18 20:48:52,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-12-18 20:48:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 378. [2021-12-18 20:48:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 247 states have (on average 1.9676113360323886) internal successors, (486), 364 states have internal predecessors, (486), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-18 20:48:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 514 transitions. [2021-12-18 20:48:52,841 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 514 transitions. Word has length 11 [2021-12-18 20:48:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:48:52,841 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 514 transitions. [2021-12-18 20:48:52,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 514 transitions. [2021-12-18 20:48:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 20:48:52,842 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:48:52,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:48:52,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 20:48:52,842 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:48:52,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:48:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash 693745101, now seen corresponding path program 1 times [2021-12-18 20:48:52,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:48:52,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933035672] [2021-12-18 20:48:52,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:48:52,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:48:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:48:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:48:52,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:48:52,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933035672] [2021-12-18 20:48:52,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933035672] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:48:52,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:48:52,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 20:48:52,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430189359] [2021-12-18 20:48:52,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:48:52,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 20:48:52,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:48:52,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 20:48:52,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:48:52,954 INFO L87 Difference]: Start difference. First operand 378 states and 514 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:48:53,251 INFO L93 Difference]: Finished difference Result 398 states and 537 transitions. [2021-12-18 20:48:53,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 20:48:53,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-18 20:48:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:48:53,254 INFO L225 Difference]: With dead ends: 398 [2021-12-18 20:48:53,254 INFO L226 Difference]: Without dead ends: 398 [2021-12-18 20:48:53,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-18 20:48:53,255 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 32 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:48:53,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 1583 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:48:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-12-18 20:48:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 386. [2021-12-18 20:48:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 254 states have (on average 1.9448818897637796) internal successors, (494), 371 states have internal predecessors, (494), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-18 20:48:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 524 transitions. [2021-12-18 20:48:53,264 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 524 transitions. Word has length 20 [2021-12-18 20:48:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:48:53,264 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 524 transitions. [2021-12-18 20:48:53,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 524 transitions. [2021-12-18 20:48:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 20:48:53,265 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:48:53,265 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:48:53,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 20:48:53,266 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:48:53,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:48:53,266 INFO L85 PathProgramCache]: Analyzing trace with hash -964577360, now seen corresponding path program 1 times [2021-12-18 20:48:53,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:48:53,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153582039] [2021-12-18 20:48:53,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:48:53,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:48:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:48:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:48:53,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:48:53,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153582039] [2021-12-18 20:48:53,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153582039] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:48:53,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:48:53,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 20:48:53,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272688073] [2021-12-18 20:48:53,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:48:53,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 20:48:53,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:48:53,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 20:48:53,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-18 20:48:53,435 INFO L87 Difference]: Start difference. First operand 386 states and 524 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:48:54,084 INFO L93 Difference]: Finished difference Result 526 states and 579 transitions. [2021-12-18 20:48:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 20:48:54,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-18 20:48:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:48:54,087 INFO L225 Difference]: With dead ends: 526 [2021-12-18 20:48:54,087 INFO L226 Difference]: Without dead ends: 526 [2021-12-18 20:48:54,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-12-18 20:48:54,087 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 511 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 20:48:54,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 1522 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-18 20:48:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-12-18 20:48:54,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 389. [2021-12-18 20:48:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 257 states have (on average 1.933852140077821) internal successors, (497), 374 states have internal predecessors, (497), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-18 20:48:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 527 transitions. [2021-12-18 20:48:54,101 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 527 transitions. Word has length 22 [2021-12-18 20:48:54,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:48:54,101 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 527 transitions. [2021-12-18 20:48:54,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:48:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 527 transitions. [2021-12-18 20:48:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 20:48:54,103 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:48:54,103 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:48:54,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 20:48:54,103 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:48:54,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:48:54,104 INFO L85 PathProgramCache]: Analyzing trace with hash -339455757, now seen corresponding path program 1 times [2021-12-18 20:48:54,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:48:54,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869267120] [2021-12-18 20:48:54,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:48:54,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:48:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:48:54,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 20:48:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:48:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:48:54,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:48:54,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869267120] [2021-12-18 20:48:54,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869267120] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:48:54,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183835125] [2021-12-18 20:48:54,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:48:54,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:48:54,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:48:54,451 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) [2021-12-18 20:48:54,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-18 20:48:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:48:54,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-18 20:48:54,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:48:54,681 INFO L388 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 [2021-12-18 20:48:54,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:48:54,986 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:48:54,986 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-18 20:48:55,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 20:48:55,063 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:48:55,063 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2021-12-18 20:48:55,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:48:55,148 INFO L354 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2021-12-18 20:48:55,148 INFO L388 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 29 treesize of output 28 [2021-12-18 20:48:55,279 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-12-18 20:48:55,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2021-12-18 20:48:55,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-18 20:48:55,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-18 20:48:55,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-18 20:48:55,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:48:55,765 INFO L388 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 41 treesize of output 17 [2021-12-18 20:48:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:48:55,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:48:56,227 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:48:56,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2021-12-18 20:48:56,240 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:48:56,241 INFO L388 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 170 treesize of output 122 [2021-12-18 20:48:56,250 INFO L388 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 86 treesize of output 78 [2021-12-18 20:48:56,257 INFO L388 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 40 treesize of output 36 [2021-12-18 20:48:56,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183835125] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:48:56,707 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:48:56,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2021-12-18 20:48:56,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092039285] [2021-12-18 20:48:56,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:48:56,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-18 20:48:56,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:48:56,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-18 20:48:56,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=994, Unknown=14, NotChecked=0, Total=1122 [2021-12-18 20:48:56,709 INFO L87 Difference]: Start difference. First operand 389 states and 527 transitions. Second operand has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 25 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:48:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:48:58,684 INFO L93 Difference]: Finished difference Result 836 states and 991 transitions. [2021-12-18 20:48:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-18 20:48:58,685 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 25 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-12-18 20:48:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:48:58,690 INFO L225 Difference]: With dead ends: 836 [2021-12-18 20:48:58,691 INFO L226 Difference]: Without dead ends: 836 [2021-12-18 20:48:58,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=228, Invalid=1564, Unknown=14, NotChecked=0, Total=1806 [2021-12-18 20:48:58,693 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 1389 mSDsluCounter, 3019 mSDsCounter, 0 mSdLazyCounter, 2700 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 3215 SdHoareTripleChecker+Invalid, 3511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 2700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 584 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-18 20:48:58,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1417 Valid, 3215 Invalid, 3511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 2700 Invalid, 0 Unknown, 584 Unchecked, 1.6s Time] [2021-12-18 20:48:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-12-18 20:48:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 455. [2021-12-18 20:48:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 294 states have (on average 1.8673469387755102) internal successors, (549), 415 states have internal predecessors, (549), 43 states have call successors, (43), 3 states have call predecessors, (43), 2 states have return successors, (85), 42 states have call predecessors, (85), 43 states have call successors, (85) [2021-12-18 20:48:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 677 transitions. [2021-12-18 20:48:58,720 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 677 transitions. Word has length 37 [2021-12-18 20:48:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:48:58,720 INFO L470 AbstractCegarLoop]: Abstraction has 455 states and 677 transitions. [2021-12-18 20:48:58,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 25 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:48:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 677 transitions. [2021-12-18 20:48:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 20:48:58,724 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:48:58,724 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:48:58,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-18 20:48:58,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:48:58,945 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:48:58,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:48:58,946 INFO L85 PathProgramCache]: Analyzing trace with hash -339455756, now seen corresponding path program 1 times [2021-12-18 20:48:58,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:48:58,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877073630] [2021-12-18 20:48:58,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:48:58,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:48:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:48:59,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 20:48:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:48:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:48:59,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:48:59,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877073630] [2021-12-18 20:48:59,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877073630] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:48:59,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737987643] [2021-12-18 20:48:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:48:59,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:48:59,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:48:59,416 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) [2021-12-18 20:48:59,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-18 20:48:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:48:59,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-18 20:48:59,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:48:59,549 INFO L388 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 [2021-12-18 20:48:59,631 INFO L388 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 [2021-12-18 20:48:59,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:48:59,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:48:59,965 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:48:59,966 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-18 20:48:59,984 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:48:59,984 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-18 20:48:59,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 20:49:00,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 20:49:00,150 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:49:00,151 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2021-12-18 20:49:00,165 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:49:00,165 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2021-12-18 20:49:00,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:00,424 INFO L354 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2021-12-18 20:49:00,424 INFO L388 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 29 treesize of output 28 [2021-12-18 20:49:00,605 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-18 20:49:00,605 INFO L388 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 22 treesize of output 24 [2021-12-18 20:49:00,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 20:49:00,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-18 20:49:00,679 INFO L388 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 16 treesize of output 18 [2021-12-18 20:49:00,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-18 20:49:00,873 INFO L388 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 16 treesize of output 18 [2021-12-18 20:49:00,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-18 20:49:00,962 INFO L388 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 16 treesize of output 18 [2021-12-18 20:49:01,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:01,029 INFO L388 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 31 treesize of output 13 [2021-12-18 20:49:01,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:01,033 INFO L388 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 [2021-12-18 20:49:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:49:01,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:49:01,140 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_511) c_append_~head.base) .cse0) 9) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_510) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_511 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_511) c_append_~head.base) (+ c_append_~head.offset 4)) 5)))) is different from false [2021-12-18 20:49:01,976 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:01,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2021-12-18 20:49:01,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:01,990 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:01,991 INFO L388 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 129 treesize of output 129 [2021-12-18 20:49:01,999 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:02,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 105 [2021-12-18 20:49:02,004 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:02,012 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:02,013 INFO L388 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 164 treesize of output 152 [2021-12-18 20:49:02,031 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:02,032 INFO L388 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 728 treesize of output 708 [2021-12-18 20:49:02,057 INFO L388 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 708 treesize of output 640 [2021-12-18 20:49:02,070 INFO L388 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 640 treesize of output 524 [2021-12-18 20:49:07,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737987643] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:49:07,248 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:49:07,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-12-18 20:49:07,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070424767] [2021-12-18 20:49:07,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:49:07,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-18 20:49:07,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:49:07,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-18 20:49:07,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=958, Unknown=2, NotChecked=62, Total=1122 [2021-12-18 20:49:07,251 INFO L87 Difference]: Start difference. First operand 455 states and 677 transitions. Second operand has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:49:08,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:49:08,762 INFO L93 Difference]: Finished difference Result 505 states and 729 transitions. [2021-12-18 20:49:08,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 20:49:08,762 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-12-18 20:49:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:49:08,765 INFO L225 Difference]: With dead ends: 505 [2021-12-18 20:49:08,765 INFO L226 Difference]: Without dead ends: 505 [2021-12-18 20:49:08,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=182, Invalid=1626, Unknown=2, NotChecked=82, Total=1892 [2021-12-18 20:49:08,767 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 114 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 3465 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 870 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-18 20:49:08,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 3465 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1796 Invalid, 0 Unknown, 870 Unchecked, 0.9s Time] [2021-12-18 20:49:08,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-12-18 20:49:08,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 498. [2021-12-18 20:49:08,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 335 states have (on average 1.7850746268656716) internal successors, (598), 456 states have internal predecessors, (598), 43 states have call successors, (43), 5 states have call predecessors, (43), 4 states have return successors, (85), 42 states have call predecessors, (85), 43 states have call successors, (85) [2021-12-18 20:49:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 726 transitions. [2021-12-18 20:49:08,785 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 726 transitions. Word has length 37 [2021-12-18 20:49:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:49:08,785 INFO L470 AbstractCegarLoop]: Abstraction has 498 states and 726 transitions. [2021-12-18 20:49:08,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:49:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 726 transitions. [2021-12-18 20:49:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-18 20:49:08,787 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:49:08,787 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:49:08,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-18 20:49:09,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-18 20:49:09,003 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting appendErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:49:09,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:49:09,004 INFO L85 PathProgramCache]: Analyzing trace with hash -794458391, now seen corresponding path program 1 times [2021-12-18 20:49:09,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:49:09,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246323133] [2021-12-18 20:49:09,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:09,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:49:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:09,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 20:49:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:09,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:49:09,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:49:09,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246323133] [2021-12-18 20:49:09,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246323133] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:49:09,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918654867] [2021-12-18 20:49:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:09,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:49:09,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:49:09,500 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) [2021-12-18 20:49:09,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-18 20:49:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:09,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-18 20:49:09,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:49:09,648 INFO L388 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 [2021-12-18 20:49:09,714 INFO L388 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 [2021-12-18 20:49:09,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:49:09,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:49:09,999 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:49:09,999 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-18 20:49:10,013 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:49:10,014 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-18 20:49:10,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 20:49:10,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 20:49:10,154 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:49:10,154 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2021-12-18 20:49:10,173 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:49:10,174 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2021-12-18 20:49:10,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:10,393 INFO L354 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2021-12-18 20:49:10,393 INFO L388 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 29 treesize of output 28 [2021-12-18 20:49:10,583 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-18 20:49:10,583 INFO L388 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 22 treesize of output 24 [2021-12-18 20:49:10,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 20:49:10,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-18 20:49:10,641 INFO L388 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 16 treesize of output 18 [2021-12-18 20:49:10,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-18 20:49:10,813 INFO L388 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 16 treesize of output 18 [2021-12-18 20:49:10,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-18 20:49:10,892 INFO L388 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 16 treesize of output 18 [2021-12-18 20:49:10,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:10,945 INFO L388 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 31 treesize of output 13 [2021-12-18 20:49:10,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:10,950 INFO L388 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 [2021-12-18 20:49:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:49:10,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:49:11,019 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_710) c_append_~head.base) .cse0) 9) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_709) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_710 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_710) c_append_~head.base) (+ c_append_~head.offset 4)) 5)))) is different from false [2021-12-18 20:49:11,393 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:11,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2021-12-18 20:49:11,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:11,409 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:11,409 INFO L388 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 129 treesize of output 129 [2021-12-18 20:49:11,416 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:11,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 105 [2021-12-18 20:49:11,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:11,427 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:11,427 INFO L388 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 164 treesize of output 152 [2021-12-18 20:49:11,439 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:11,439 INFO L388 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 588 treesize of output 572 [2021-12-18 20:49:11,449 INFO L388 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 572 treesize of output 520 [2021-12-18 20:49:11,458 INFO L388 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 520 treesize of output 404 [2021-12-18 20:49:14,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918654867] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:49:14,534 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:49:14,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2021-12-18 20:49:14,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667012193] [2021-12-18 20:49:14,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:49:14,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-18 20:49:14,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:49:14,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-18 20:49:14,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=4, NotChecked=58, Total=992 [2021-12-18 20:49:14,535 INFO L87 Difference]: Start difference. First operand 498 states and 726 transitions. Second operand has 26 states, 25 states have (on average 2.8) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:49:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:49:15,895 INFO L93 Difference]: Finished difference Result 547 states and 785 transitions. [2021-12-18 20:49:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 20:49:15,896 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.8) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2021-12-18 20:49:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:49:15,899 INFO L225 Difference]: With dead ends: 547 [2021-12-18 20:49:15,899 INFO L226 Difference]: Without dead ends: 547 [2021-12-18 20:49:15,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=171, Invalid=1311, Unknown=4, NotChecked=74, Total=1560 [2021-12-18 20:49:15,900 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 70 mSDsluCounter, 2662 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2980 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 543 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-18 20:49:15,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 2980 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2116 Invalid, 0 Unknown, 543 Unchecked, 0.9s Time] [2021-12-18 20:49:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-12-18 20:49:15,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 540. [2021-12-18 20:49:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 374 states have (on average 1.7272727272727273) internal successors, (646), 495 states have internal predecessors, (646), 45 states have call successors, (45), 7 states have call predecessors, (45), 5 states have return successors, (89), 43 states have call predecessors, (89), 45 states have call successors, (89) [2021-12-18 20:49:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 780 transitions. [2021-12-18 20:49:15,924 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 780 transitions. Word has length 39 [2021-12-18 20:49:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:49:15,924 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 780 transitions. [2021-12-18 20:49:15,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.8) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:49:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 780 transitions. [2021-12-18 20:49:15,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-18 20:49:15,929 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:49:15,930 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:49:15,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-18 20:49:16,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:49:16,154 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:49:16,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:49:16,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1733156522, now seen corresponding path program 1 times [2021-12-18 20:49:16,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:49:16,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997829388] [2021-12-18 20:49:16,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:16,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:49:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 20:49:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:49:16,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:49:16,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997829388] [2021-12-18 20:49:16,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997829388] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:49:16,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663035690] [2021-12-18 20:49:16,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:16,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:49:16,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:49:16,465 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) [2021-12-18 20:49:16,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-18 20:49:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:16,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-18 20:49:16,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:49:16,613 INFO L388 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 [2021-12-18 20:49:16,797 INFO L388 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 [2021-12-18 20:49:16,831 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-18 20:49:16,832 INFO L388 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 21 treesize of output 20 [2021-12-18 20:49:16,870 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:49:16,871 INFO L388 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 27 [2021-12-18 20:49:16,889 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-18 20:49:16,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 7 [2021-12-18 20:49:16,941 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:49:16,941 INFO L388 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 28 treesize of output 32 [2021-12-18 20:49:17,014 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-18 20:49:17,015 INFO L388 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 17 treesize of output 17 [2021-12-18 20:49:17,100 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:49:17,100 INFO L388 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 [2021-12-18 20:49:17,128 INFO L388 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 34 treesize of output 30 [2021-12-18 20:49:17,154 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:17,154 INFO L388 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 35 treesize of output 15 [2021-12-18 20:49:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:49:17,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:49:17,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_899) c_append_~head.base) c_append_~head.offset)))) is different from false [2021-12-18 20:49:17,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (v_append_~node~0.base_33 Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_33 v_ArrVal_899) |c_append_#in~head.base|) |c_append_#in~head.offset|))) (not (= 0 (select |c_#valid| v_append_~node~0.base_33))))) is different from false [2021-12-18 20:49:17,233 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (v_append_~node~0.base_33 Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_33 v_ArrVal_899) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= 0 (select |c_#valid| v_append_~node~0.base_33))))) is different from false [2021-12-18 20:49:17,316 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-18 20:49:17,317 INFO L388 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 [2021-12-18 20:49:17,319 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:17,321 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-18 20:49:17,321 INFO L388 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 64 treesize of output 34 [2021-12-18 20:49:17,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-18 20:49:17,328 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:49:17,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-18 20:49:17,488 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-18 20:49:17,489 INFO L388 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 27 treesize of output 33 [2021-12-18 20:49:17,513 INFO L354 Elim1Store]: treesize reduction 10, result has 71.4 percent of original size [2021-12-18 20:49:17,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 147 [2021-12-18 20:49:17,519 INFO L388 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 114 treesize of output 110 [2021-12-18 20:49:17,523 INFO L388 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 110 treesize of output 102 [2021-12-18 20:49:17,877 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:49:17,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-18 20:49:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-18 20:49:18,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663035690] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:49:18,013 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:49:18,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 37 [2021-12-18 20:49:18,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299071397] [2021-12-18 20:49:18,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:49:18,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-18 20:49:18,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:49:18,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-18 20:49:18,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=986, Unknown=7, NotChecked=198, Total=1332 [2021-12-18 20:49:18,015 INFO L87 Difference]: Start difference. First operand 540 states and 780 transitions. Second operand has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 31 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 20:49:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:49:20,165 INFO L93 Difference]: Finished difference Result 578 states and 630 transitions. [2021-12-18 20:49:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-18 20:49:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 31 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2021-12-18 20:49:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:49:20,180 INFO L225 Difference]: With dead ends: 578 [2021-12-18 20:49:20,180 INFO L226 Difference]: Without dead ends: 578 [2021-12-18 20:49:20,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=445, Invalid=2105, Unknown=12, NotChecked=300, Total=2862 [2021-12-18 20:49:20,182 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 912 mSDsluCounter, 3175 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 3365 SdHoareTripleChecker+Invalid, 4477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1692 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:49:20,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [912 Valid, 3365 Invalid, 4477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 2592 Invalid, 0 Unknown, 1692 Unchecked, 1.1s Time] [2021-12-18 20:49:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-12-18 20:49:20,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 443. [2021-12-18 20:49:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 305 states have (on average 1.7901639344262295) internal successors, (546), 424 states have internal predecessors, (546), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-18 20:49:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 580 transitions. [2021-12-18 20:49:20,195 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 580 transitions. Word has length 39 [2021-12-18 20:49:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:49:20,196 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 580 transitions. [2021-12-18 20:49:20,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 31 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 20:49:20,196 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 580 transitions. [2021-12-18 20:49:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-18 20:49:20,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:49:20,198 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:49:20,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-18 20:49:20,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:49:20,422 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:49:20,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:49:20,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1807925700, now seen corresponding path program 1 times [2021-12-18 20:49:20,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:49:20,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747313363] [2021-12-18 20:49:20,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:20,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:49:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:20,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 20:49:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:20,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-18 20:49:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:49:20,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:49:20,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747313363] [2021-12-18 20:49:20,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747313363] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:49:20,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732713197] [2021-12-18 20:49:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:20,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:49:20,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:49:20,674 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) [2021-12-18 20:49:20,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-18 20:49:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:20,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-18 20:49:20,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:49:20,920 INFO L388 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 [2021-12-18 20:49:21,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:49:21,146 INFO L354 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2021-12-18 20:49:21,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2021-12-18 20:49:21,177 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:21,278 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:21,306 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:21,331 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:21,331 INFO L388 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 19 treesize of output 9 [2021-12-18 20:49:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:49:21,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:49:21,573 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:21,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-18 20:49:21,581 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-12-18 20:49:21,582 INFO L388 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 84 treesize of output 57 [2021-12-18 20:49:21,628 INFO L354 Elim1Store]: treesize reduction 10, result has 83.6 percent of original size [2021-12-18 20:49:21,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 278 treesize of output 308 [2021-12-18 20:49:21,641 INFO L388 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 37 treesize of output 25 [2021-12-18 20:49:21,765 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:21,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-18 20:49:21,773 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:21,773 INFO L388 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 46 treesize of output 49 [2021-12-18 20:49:21,776 INFO L388 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 16 treesize of output 12 [2021-12-18 20:49:28,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:49:28,192 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-18 20:49:28,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 1 [2021-12-18 20:49:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:49:28,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732713197] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:49:28,230 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:49:28,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 31 [2021-12-18 20:49:28,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149797737] [2021-12-18 20:49:28,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:49:28,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-18 20:49:28,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:49:28,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-18 20:49:28,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=874, Unknown=7, NotChecked=0, Total=992 [2021-12-18 20:49:28,232 INFO L87 Difference]: Start difference. First operand 443 states and 580 transitions. Second operand has 32 states, 29 states have (on average 4.241379310344827) internal successors, (123), 26 states have internal predecessors, (123), 4 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-18 20:49:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:49:29,255 INFO L93 Difference]: Finished difference Result 460 states and 596 transitions. [2021-12-18 20:49:29,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 20:49:29,255 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 4.241379310344827) internal successors, (123), 26 states have internal predecessors, (123), 4 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2021-12-18 20:49:29,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:49:29,257 INFO L225 Difference]: With dead ends: 460 [2021-12-18 20:49:29,257 INFO L226 Difference]: Without dead ends: 460 [2021-12-18 20:49:29,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 94 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=298, Invalid=1417, Unknown=7, NotChecked=0, Total=1722 [2021-12-18 20:49:29,259 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 661 mSDsluCounter, 2981 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 3280 SdHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 771 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 20:49:29,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [673 Valid, 3280 Invalid, 2395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1551 Invalid, 0 Unknown, 771 Unchecked, 0.7s Time] [2021-12-18 20:49:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-12-18 20:49:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 459. [2021-12-18 20:49:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 320 states have (on average 1.75625) internal successors, (562), 439 states have internal predecessors, (562), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-18 20:49:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 596 transitions. [2021-12-18 20:49:29,267 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 596 transitions. Word has length 54 [2021-12-18 20:49:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:49:29,267 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 596 transitions. [2021-12-18 20:49:29,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 4.241379310344827) internal successors, (123), 26 states have internal predecessors, (123), 4 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-18 20:49:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 596 transitions. [2021-12-18 20:49:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-18 20:49:29,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:49:29,268 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:49:29,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-18 20:49:29,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-18 20:49:29,487 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting appendErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:49:29,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:49:29,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1807925701, now seen corresponding path program 1 times [2021-12-18 20:49:29,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:49:29,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18571624] [2021-12-18 20:49:29,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:29,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:49:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:29,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 20:49:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-18 20:49:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:49:29,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:49:29,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18571624] [2021-12-18 20:49:29,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18571624] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:49:29,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068782062] [2021-12-18 20:49:29,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:29,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:49:29,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:49:29,828 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) [2021-12-18 20:49:29,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-18 20:49:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:30,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-18 20:49:30,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:49:30,114 INFO L388 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 [2021-12-18 20:49:30,117 INFO L388 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 [2021-12-18 20:49:30,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:49:30,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:49:30,419 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-18 20:49:30,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2021-12-18 20:49:30,438 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-12-18 20:49:30,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2021-12-18 20:49:30,473 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:30,478 INFO L388 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 14 treesize of output 16 [2021-12-18 20:49:30,562 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:30,569 INFO L388 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 14 treesize of output 16 [2021-12-18 20:49:30,594 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:30,597 INFO L388 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 14 treesize of output 16 [2021-12-18 20:49:30,610 INFO L388 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 [2021-12-18 20:49:30,611 INFO L388 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 17 treesize of output 9 [2021-12-18 20:49:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:49:30,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:49:30,669 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1449 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_1449) c_append_~head.base) (+ c_append_~head.offset 4)) 5))) (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1450 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_1449) c_append_~head.base) .cse0) 9) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_1450) c_append_~head.base) .cse0)))))) is different from false [2021-12-18 20:49:31,152 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:31,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 77 [2021-12-18 20:49:31,155 INFO L388 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 446 treesize of output 424 [2021-12-18 20:49:31,162 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:31,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 424 treesize of output 344 [2021-12-18 20:49:31,165 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:31,185 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-12-18 20:49:31,186 INFO L388 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 317 treesize of output 260 [2021-12-18 20:49:31,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:31,194 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 20:49:31,194 INFO L388 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 218 treesize of output 128 [2021-12-18 20:49:31,201 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:49:31,201 INFO L388 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 25 treesize of output 24 [2021-12-18 20:49:31,531 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:31,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2021-12-18 20:49:31,537 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:31,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 64 [2021-12-18 20:49:31,549 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:31,550 INFO L388 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 94 treesize of output 97 [2021-12-18 20:49:31,559 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:31,559 INFO L388 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 159 treesize of output 150 [2021-12-18 20:49:31,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 103 [2021-12-18 20:49:31,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2021-12-18 20:49:31,576 INFO L388 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 95 treesize of output 91 [2021-12-18 20:49:32,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2021-12-18 20:49:32,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068782062] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:49:32,353 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:49:32,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 11] total 30 [2021-12-18 20:49:32,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446207737] [2021-12-18 20:49:32,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:49:32,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-18 20:49:32,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:49:32,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-18 20:49:32,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=772, Unknown=1, NotChecked=56, Total=930 [2021-12-18 20:49:32,355 INFO L87 Difference]: Start difference. First operand 459 states and 596 transitions. Second operand has 31 states, 28 states have (on average 4.392857142857143) internal successors, (123), 25 states have internal predecessors, (123), 4 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-18 20:49:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:49:33,875 INFO L93 Difference]: Finished difference Result 594 states and 645 transitions. [2021-12-18 20:49:33,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 20:49:33,875 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 4.392857142857143) internal successors, (123), 25 states have internal predecessors, (123), 4 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2021-12-18 20:49:33,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:49:33,877 INFO L225 Difference]: With dead ends: 594 [2021-12-18 20:49:33,877 INFO L226 Difference]: Without dead ends: 594 [2021-12-18 20:49:33,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 93 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=258, Invalid=1305, Unknown=1, NotChecked=76, Total=1640 [2021-12-18 20:49:33,878 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 1596 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 4507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2214 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:49:33,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1597 Valid, 1899 Invalid, 4507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2197 Invalid, 0 Unknown, 2214 Unchecked, 1.0s Time] [2021-12-18 20:49:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-12-18 20:49:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 459. [2021-12-18 20:49:33,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 320 states have (on average 1.753125) internal successors, (561), 439 states have internal predecessors, (561), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-18 20:49:33,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 595 transitions. [2021-12-18 20:49:33,887 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 595 transitions. Word has length 54 [2021-12-18 20:49:33,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:49:33,888 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 595 transitions. [2021-12-18 20:49:33,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 4.392857142857143) internal successors, (123), 25 states have internal predecessors, (123), 4 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-18 20:49:33,888 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 595 transitions. [2021-12-18 20:49:33,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-18 20:49:33,889 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:49:33,889 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:49:33,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-18 20:49:34,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:49:34,103 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:49:34,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:49:34,103 INFO L85 PathProgramCache]: Analyzing trace with hash 452493324, now seen corresponding path program 1 times [2021-12-18 20:49:34,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:49:34,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697237263] [2021-12-18 20:49:34,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:34,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:49:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:34,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 20:49:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:34,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 20:49:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 20:49:34,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:49:34,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697237263] [2021-12-18 20:49:34,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697237263] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:49:34,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647646840] [2021-12-18 20:49:34,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:34,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:49:34,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:49:34,338 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) [2021-12-18 20:49:34,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-18 20:49:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:34,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-18 20:49:34,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:49:34,594 INFO L388 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 [2021-12-18 20:49:34,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:49:34,824 INFO L354 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2021-12-18 20:49:34,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2021-12-18 20:49:34,853 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:34,939 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:34,964 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:34,990 INFO L388 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 17 treesize of output 9 [2021-12-18 20:49:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 20:49:35,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:49:35,200 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:35,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-18 20:49:35,207 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-12-18 20:49:35,207 INFO L388 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 84 treesize of output 57 [2021-12-18 20:49:35,237 INFO L354 Elim1Store]: treesize reduction 10, result has 83.6 percent of original size [2021-12-18 20:49:35,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 228 treesize of output 260 [2021-12-18 20:49:35,244 INFO L388 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 37 treesize of output 25 [2021-12-18 20:49:35,316 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:35,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-18 20:49:35,322 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:35,322 INFO L388 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 46 treesize of output 49 [2021-12-18 20:49:35,325 INFO L388 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 16 treesize of output 12 [2021-12-18 20:49:42,569 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-18 20:49:42,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 1 [2021-12-18 20:49:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 20:49:42,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647646840] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:49:42,601 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:49:42,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 26 [2021-12-18 20:49:42,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329770838] [2021-12-18 20:49:42,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:49:42,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-18 20:49:42,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:49:42,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-18 20:49:42,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=608, Unknown=8, NotChecked=0, Total=702 [2021-12-18 20:49:42,603 INFO L87 Difference]: Start difference. First operand 459 states and 595 transitions. Second operand has 27 states, 26 states have (on average 4.384615384615385) internal successors, (114), 24 states have internal predecessors, (114), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-18 20:49:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:49:43,605 INFO L93 Difference]: Finished difference Result 594 states and 644 transitions. [2021-12-18 20:49:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 20:49:43,605 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.384615384615385) internal successors, (114), 24 states have internal predecessors, (114), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-18 20:49:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:49:43,607 INFO L225 Difference]: With dead ends: 594 [2021-12-18 20:49:43,607 INFO L226 Difference]: Without dead ends: 594 [2021-12-18 20:49:43,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 104 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=954, Unknown=8, NotChecked=0, Total=1190 [2021-12-18 20:49:43,608 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 1084 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 624 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 20:49:43,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1084 Valid, 2539 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1452 Invalid, 0 Unknown, 624 Unchecked, 0.7s Time] [2021-12-18 20:49:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-12-18 20:49:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 442. [2021-12-18 20:49:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 305 states have (on average 1.7868852459016393) internal successors, (545), 423 states have internal predecessors, (545), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2021-12-18 20:49:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 577 transitions. [2021-12-18 20:49:43,616 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 577 transitions. Word has length 58 [2021-12-18 20:49:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:49:43,616 INFO L470 AbstractCegarLoop]: Abstraction has 442 states and 577 transitions. [2021-12-18 20:49:43,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.384615384615385) internal successors, (114), 24 states have internal predecessors, (114), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-18 20:49:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 577 transitions. [2021-12-18 20:49:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-18 20:49:43,617 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:49:43,617 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:49:43,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 20:49:43,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:49:43,831 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting appendErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:49:43,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:49:43,832 INFO L85 PathProgramCache]: Analyzing trace with hash 59397057, now seen corresponding path program 1 times [2021-12-18 20:49:43,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:49:43,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236722434] [2021-12-18 20:49:43,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:43,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:49:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:43,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 20:49:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:43,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 20:49:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 20:49:44,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:49:44,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236722434] [2021-12-18 20:49:44,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236722434] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:49:44,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596897469] [2021-12-18 20:49:44,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:44,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:49:44,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:49:44,080 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) [2021-12-18 20:49:44,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-18 20:49:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:44,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-18 20:49:44,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:49:44,313 INFO L388 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 [2021-12-18 20:49:44,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:49:44,560 INFO L354 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2021-12-18 20:49:44,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2021-12-18 20:49:44,590 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:44,673 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:44,697 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:44,721 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:44,721 INFO L388 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 19 treesize of output 9 [2021-12-18 20:49:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 20:49:44,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:49:44,751 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1998 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_1998) c_append_~head.base) (+ c_append_~head.offset 4))) 1)) is different from false [2021-12-18 20:49:45,007 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:45,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-18 20:49:45,022 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-12-18 20:49:45,022 INFO L388 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 84 treesize of output 57 [2021-12-18 20:49:45,052 INFO L354 Elim1Store]: treesize reduction 10, result has 83.6 percent of original size [2021-12-18 20:49:45,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 228 treesize of output 260 [2021-12-18 20:49:45,060 INFO L388 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 37 treesize of output 25 [2021-12-18 20:49:45,202 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:45,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-18 20:49:45,208 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:45,208 INFO L388 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 46 treesize of output 49 [2021-12-18 20:49:45,213 INFO L388 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 16 treesize of output 12 [2021-12-18 20:49:50,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:49:50,437 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-18 20:49:50,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 1 [2021-12-18 20:49:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2021-12-18 20:49:50,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596897469] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:49:50,476 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:49:50,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2021-12-18 20:49:50,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625024659] [2021-12-18 20:49:50,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:49:50,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-18 20:49:50,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:49:50,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-18 20:49:50,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=718, Unknown=2, NotChecked=54, Total=870 [2021-12-18 20:49:50,478 INFO L87 Difference]: Start difference. First operand 442 states and 577 transitions. Second operand has 30 states, 29 states have (on average 4.068965517241379) internal successors, (118), 26 states have internal predecessors, (118), 4 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-18 20:49:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:49:51,785 INFO L93 Difference]: Finished difference Result 598 states and 648 transitions. [2021-12-18 20:49:51,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 20:49:51,786 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.068965517241379) internal successors, (118), 26 states have internal predecessors, (118), 4 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2021-12-18 20:49:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:49:51,788 INFO L225 Difference]: With dead ends: 598 [2021-12-18 20:49:51,788 INFO L226 Difference]: Without dead ends: 598 [2021-12-18 20:49:51,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 106 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=1221, Unknown=2, NotChecked=74, Total=1560 [2021-12-18 20:49:51,789 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 886 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 3631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1555 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-18 20:49:51,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [887 Valid, 2928 Invalid, 3631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1979 Invalid, 0 Unknown, 1555 Unchecked, 0.9s Time] [2021-12-18 20:49:51,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-12-18 20:49:51,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 458. [2021-12-18 20:49:51,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 320 states have (on average 1.753125) internal successors, (561), 438 states have internal predecessors, (561), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2021-12-18 20:49:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 593 transitions. [2021-12-18 20:49:51,803 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 593 transitions. Word has length 60 [2021-12-18 20:49:51,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:49:51,803 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 593 transitions. [2021-12-18 20:49:51,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.068965517241379) internal successors, (118), 26 states have internal predecessors, (118), 4 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-18 20:49:51,803 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 593 transitions. [2021-12-18 20:49:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-18 20:49:51,804 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:49:51,804 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:49:51,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-18 20:49:52,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-18 20:49:52,019 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting appendErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:49:52,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:49:52,020 INFO L85 PathProgramCache]: Analyzing trace with hash 59397058, now seen corresponding path program 1 times [2021-12-18 20:49:52,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:49:52,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670049010] [2021-12-18 20:49:52,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:52,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:49:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:52,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 20:49:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:52,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 20:49:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 20:49:52,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:49:52,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670049010] [2021-12-18 20:49:52,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670049010] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:49:52,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292989219] [2021-12-18 20:49:52,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:52,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:49:52,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:49:52,273 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) [2021-12-18 20:49:52,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-18 20:49:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:52,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-18 20:49:52,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:49:52,551 INFO L388 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 [2021-12-18 20:49:52,557 INFO L388 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 [2021-12-18 20:49:52,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:49:52,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:49:52,881 INFO L354 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2021-12-18 20:49:52,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:49:52,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 20:49:52,918 INFO L388 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 28 treesize of output 28 [2021-12-18 20:49:52,921 INFO L388 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 16 treesize of output 18 [2021-12-18 20:49:53,027 INFO L388 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 28 treesize of output 28 [2021-12-18 20:49:53,030 INFO L388 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 16 treesize of output 18 [2021-12-18 20:49:53,061 INFO L388 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 28 treesize of output 28 [2021-12-18 20:49:53,065 INFO L388 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 16 treesize of output 18 [2021-12-18 20:49:53,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:53,101 INFO L388 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 21 treesize of output 9 [2021-12-18 20:49:53,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:53,105 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:53,105 INFO L388 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 19 treesize of output 10 [2021-12-18 20:49:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 20:49:53,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:49:53,169 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2274 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_2274) c_append_~head.base) (+ c_append_~head.offset 4)) 5))) (forall ((v_ArrVal_2275 (Array Int Int)) (v_ArrVal_2274 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_2274) c_append_~head.base) .cse0) 9) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_2275) c_append_~head.base) .cse0)))))) is different from false [2021-12-18 20:49:53,925 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:53,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 77 [2021-12-18 20:49:53,928 INFO L388 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 227 treesize of output 216 [2021-12-18 20:49:53,932 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:53,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 176 [2021-12-18 20:49:53,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:53,940 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-12-18 20:49:53,941 INFO L388 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 161 treesize of output 128 [2021-12-18 20:49:53,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:53,947 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 20:49:53,947 INFO L388 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 110 treesize of output 68 [2021-12-18 20:49:53,953 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:49:53,953 INFO L388 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 25 treesize of output 24 [2021-12-18 20:49:54,184 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:54,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2021-12-18 20:49:54,188 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:54,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 64 [2021-12-18 20:49:54,194 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:54,194 INFO L388 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 94 treesize of output 97 [2021-12-18 20:49:54,201 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:54,201 INFO L388 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 159 treesize of output 150 [2021-12-18 20:49:54,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 103 [2021-12-18 20:49:54,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2021-12-18 20:49:54,212 INFO L388 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 95 treesize of output 91 [2021-12-18 20:49:55,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:49:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2021-12-18 20:49:55,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292989219] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:49:55,163 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:49:55,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-12-18 20:49:55,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005453947] [2021-12-18 20:49:55,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:49:55,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-18 20:49:55,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:49:55,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-18 20:49:55,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=783, Unknown=1, NotChecked=56, Total=930 [2021-12-18 20:49:55,164 INFO L87 Difference]: Start difference. First operand 458 states and 593 transitions. Second operand has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 27 states have internal predecessors, (124), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-18 20:49:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:49:56,774 INFO L93 Difference]: Finished difference Result 609 states and 658 transitions. [2021-12-18 20:49:56,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 20:49:56,775 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 27 states have internal predecessors, (124), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2021-12-18 20:49:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:49:56,776 INFO L225 Difference]: With dead ends: 609 [2021-12-18 20:49:56,776 INFO L226 Difference]: Without dead ends: 609 [2021-12-18 20:49:56,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 107 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=263, Invalid=1462, Unknown=1, NotChecked=80, Total=1806 [2021-12-18 20:49:56,780 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 1340 mSDsluCounter, 2332 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 3856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1611 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-18 20:49:56,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1340 Valid, 2482 Invalid, 3856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2139 Invalid, 0 Unknown, 1611 Unchecked, 0.9s Time] [2021-12-18 20:49:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2021-12-18 20:49:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 436. [2021-12-18 20:49:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 301 states have (on average 1.787375415282392) internal successors, (538), 418 states have internal predecessors, (538), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-18 20:49:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 568 transitions. [2021-12-18 20:49:56,787 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 568 transitions. Word has length 60 [2021-12-18 20:49:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:49:56,788 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 568 transitions. [2021-12-18 20:49:56,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 27 states have internal predecessors, (124), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-18 20:49:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 568 transitions. [2021-12-18 20:49:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-18 20:49:56,789 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:49:56,789 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:49:56,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-18 20:49:57,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-18 20:49:57,018 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting appendErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:49:57,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:49:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash 374181203, now seen corresponding path program 1 times [2021-12-18 20:49:57,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:49:57,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930509019] [2021-12-18 20:49:57,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:57,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:49:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:57,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 20:49:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:57,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-18 20:49:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:57,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 20:49:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 20:49:57,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:49:57,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930509019] [2021-12-18 20:49:57,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930509019] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:49:57,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079721396] [2021-12-18 20:49:57,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:49:57,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:49:57,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:49:57,296 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) [2021-12-18 20:49:57,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-18 20:49:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:49:57,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-18 20:49:57,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:49:57,617 INFO L388 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 [2021-12-18 20:49:57,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:49:57,820 INFO L354 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2021-12-18 20:49:57,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2021-12-18 20:49:57,854 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:57,914 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:57,951 INFO L388 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 24 treesize of output 24 [2021-12-18 20:49:57,979 INFO L388 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 25 treesize of output 13 [2021-12-18 20:49:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 41 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 20:49:58,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:49:58,086 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2646 (Array Int Int)) (v_append_~node~0.base_78 Int)) (or (not (= 0 (select |c_#valid| v_append_~node~0.base_78))) (= (select (store |c_#valid| v_append_~node~0.base_78 1) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_78 v_ArrVal_2646) |c_append_#in~head.base|) (+ |c_append_#in~head.offset| 4))) 1))) is different from false [2021-12-18 20:49:58,094 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2646 (Array Int Int)) (v_append_~node~0.base_78 Int)) (or (= (select (store |c_#valid| v_append_~node~0.base_78 1) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_78 v_ArrVal_2646) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= 0 (select |c_#valid| v_append_~node~0.base_78))))) is different from false [2021-12-18 20:49:58,140 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:58,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-18 20:49:58,147 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-12-18 20:49:58,147 INFO L388 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 84 treesize of output 57 [2021-12-18 20:49:58,172 INFO L354 Elim1Store]: treesize reduction 18, result has 70.5 percent of original size [2021-12-18 20:49:58,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 130 [2021-12-18 20:49:58,176 INFO L388 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 37 treesize of output 25 [2021-12-18 20:49:58,243 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:58,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-18 20:49:58,255 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:58,255 INFO L388 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 46 treesize of output 49 [2021-12-18 20:49:58,259 INFO L388 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 16 treesize of output 12 [2021-12-18 20:50:02,132 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-18 20:50:02,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 1 [2021-12-18 20:50:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 41 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 20:50:02,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079721396] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:50:02,181 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:50:02,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2021-12-18 20:50:02,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589960434] [2021-12-18 20:50:02,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:50:02,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-18 20:50:02,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:50:02,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-18 20:50:02,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=8, NotChecked=98, Total=756 [2021-12-18 20:50:02,184 INFO L87 Difference]: Start difference. First operand 436 states and 568 transitions. Second operand has 28 states, 25 states have (on average 4.84) internal successors, (121), 23 states have internal predecessors, (121), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-18 20:50:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:50:03,206 INFO L93 Difference]: Finished difference Result 599 states and 649 transitions. [2021-12-18 20:50:03,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 20:50:03,207 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 4.84) internal successors, (121), 23 states have internal predecessors, (121), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2021-12-18 20:50:03,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:50:03,209 INFO L225 Difference]: With dead ends: 599 [2021-12-18 20:50:03,209 INFO L226 Difference]: Without dead ends: 599 [2021-12-18 20:50:03,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 131 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=242, Invalid=1016, Unknown=10, NotChecked=138, Total=1406 [2021-12-18 20:50:03,211 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 1141 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2012 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 20:50:03,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1141 Valid, 2059 Invalid, 3581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1476 Invalid, 0 Unknown, 2012 Unchecked, 0.7s Time] [2021-12-18 20:50:03,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-12-18 20:50:03,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 452. [2021-12-18 20:50:03,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 316 states have (on average 1.75) internal successors, (553), 433 states have internal predecessors, (553), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-18 20:50:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 583 transitions. [2021-12-18 20:50:03,218 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 583 transitions. Word has length 71 [2021-12-18 20:50:03,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:50:03,218 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 583 transitions. [2021-12-18 20:50:03,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 4.84) internal successors, (121), 23 states have internal predecessors, (121), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-18 20:50:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 583 transitions. [2021-12-18 20:50:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-18 20:50:03,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:50:03,220 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:50:03,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-18 20:50:03,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-18 20:50:03,444 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting appendErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:50:03,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:50:03,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1383001628, now seen corresponding path program 1 times [2021-12-18 20:50:03,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:50:03,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095790978] [2021-12-18 20:50:03,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:50:03,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:50:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:03,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 20:50:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:03,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-18 20:50:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:03,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 20:50:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:03,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 20:50:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 64 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-18 20:50:03,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:50:03,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095790978] [2021-12-18 20:50:03,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095790978] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:50:03,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706492418] [2021-12-18 20:50:03,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:50:03,787 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:50:03,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:50:03,792 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) [2021-12-18 20:50:03,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-18 20:50:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:04,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-18 20:50:04,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:50:04,134 INFO L388 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 [2021-12-18 20:50:04,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:50:04,307 INFO L354 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2021-12-18 20:50:04,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2021-12-18 20:50:04,356 INFO L388 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 28 treesize of output 28 [2021-12-18 20:50:04,475 INFO L388 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 28 treesize of output 28 [2021-12-18 20:50:04,506 INFO L388 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 28 treesize of output 28 [2021-12-18 20:50:04,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:50:04,536 INFO L388 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 21 treesize of output 9 [2021-12-18 20:50:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 68 proven. 11 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-18 20:50:04,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:50:04,748 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:50:04,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-18 20:50:04,757 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-12-18 20:50:04,758 INFO L388 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 84 treesize of output 57 [2021-12-18 20:50:04,789 INFO L354 Elim1Store]: treesize reduction 10, result has 83.6 percent of original size [2021-12-18 20:50:04,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 228 treesize of output 260 [2021-12-18 20:50:04,797 INFO L388 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 37 treesize of output 25 [2021-12-18 20:50:04,926 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:50:04,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-18 20:50:04,933 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:50:04,933 INFO L388 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 46 treesize of output 49 [2021-12-18 20:50:04,937 INFO L388 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 16 treesize of output 12 [2021-12-18 20:50:11,592 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-18 20:50:11,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 1 [2021-12-18 20:50:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 68 proven. 11 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-18 20:50:11,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706492418] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:50:11,660 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:50:11,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2021-12-18 20:50:11,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631093387] [2021-12-18 20:50:11,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:50:11,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-18 20:50:11,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:50:11,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-18 20:50:11,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=603, Unknown=11, NotChecked=0, Total=702 [2021-12-18 20:50:11,662 INFO L87 Difference]: Start difference. First operand 452 states and 583 transitions. Second operand has 27 states, 23 states have (on average 4.608695652173913) internal successors, (106), 20 states have internal predecessors, (106), 5 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-18 20:50:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:50:12,372 INFO L93 Difference]: Finished difference Result 605 states and 655 transitions. [2021-12-18 20:50:12,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 20:50:12,372 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 4.608695652173913) internal successors, (106), 20 states have internal predecessors, (106), 5 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2021-12-18 20:50:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:50:12,373 INFO L225 Difference]: With dead ends: 605 [2021-12-18 20:50:12,374 INFO L226 Difference]: Without dead ends: 605 [2021-12-18 20:50:12,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 168 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=874, Unknown=12, NotChecked=0, Total=1056 [2021-12-18 20:50:12,374 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 823 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 2564 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 983 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 20:50:12,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [823 Valid, 2564 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1229 Invalid, 0 Unknown, 983 Unchecked, 0.6s Time] [2021-12-18 20:50:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-12-18 20:50:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 464. [2021-12-18 20:50:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 328 states have (on average 1.7225609756097562) internal successors, (565), 444 states have internal predecessors, (565), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-18 20:50:12,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 595 transitions. [2021-12-18 20:50:12,388 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 595 transitions. Word has length 88 [2021-12-18 20:50:12,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:50:12,388 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 595 transitions. [2021-12-18 20:50:12,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 4.608695652173913) internal successors, (106), 20 states have internal predecessors, (106), 5 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-18 20:50:12,389 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 595 transitions. [2021-12-18 20:50:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-18 20:50:12,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:50:12,390 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:50:12,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-18 20:50:12,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:50:12,615 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting appendErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:50:12,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:50:12,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1420345779, now seen corresponding path program 1 times [2021-12-18 20:50:12,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:50:12,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053868839] [2021-12-18 20:50:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:50:12,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:50:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:12,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 20:50:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:12,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-18 20:50:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:12,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 20:50:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:12,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 20:50:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:12,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 20:50:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-18 20:50:13,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:50:13,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053868839] [2021-12-18 20:50:13,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053868839] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:50:13,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139616942] [2021-12-18 20:50:13,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:50:13,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:50:13,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:50:13,032 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) [2021-12-18 20:50:13,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-18 20:50:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:13,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-18 20:50:13,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:50:13,498 INFO L388 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 [2021-12-18 20:50:13,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:50:13,683 INFO L354 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2021-12-18 20:50:13,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2021-12-18 20:50:13,714 INFO L388 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 28 treesize of output 28 [2021-12-18 20:50:13,813 INFO L388 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 28 treesize of output 28 [2021-12-18 20:50:13,845 INFO L388 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 28 treesize of output 28 [2021-12-18 20:50:13,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:50:13,876 INFO L388 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 21 treesize of output 9 [2021-12-18 20:50:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 95 proven. 11 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-18 20:50:13,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:50:13,906 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3667 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_3667) c_append_~head.base) (+ c_append_~head.offset 4))) 1)) is different from false [2021-12-18 20:50:14,064 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:50:14,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-18 20:50:14,070 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-12-18 20:50:14,071 INFO L388 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 84 treesize of output 57 [2021-12-18 20:50:14,100 INFO L354 Elim1Store]: treesize reduction 10, result has 83.6 percent of original size [2021-12-18 20:50:14,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 228 [2021-12-18 20:50:14,108 INFO L388 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 37 treesize of output 25 [2021-12-18 20:50:14,254 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:50:14,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-18 20:50:14,261 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:50:14,261 INFO L388 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 46 treesize of output 49 [2021-12-18 20:50:14,264 INFO L388 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 16 treesize of output 12 [2021-12-18 20:50:21,916 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-18 20:50:21,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 1 [2021-12-18 20:50:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 95 proven. 4 refuted. 0 times theorem prover too weak. 76 trivial. 7 not checked. [2021-12-18 20:50:21,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139616942] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:50:21,999 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:50:21,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 27 [2021-12-18 20:50:21,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991673340] [2021-12-18 20:50:21,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:50:21,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-18 20:50:21,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:50:22,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-18 20:50:22,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=614, Unknown=2, NotChecked=50, Total=756 [2021-12-18 20:50:22,000 INFO L87 Difference]: Start difference. First operand 464 states and 595 transitions. Second operand has 28 states, 24 states have (on average 4.458333333333333) internal successors, (107), 21 states have internal predecessors, (107), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-18 20:50:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:50:22,700 INFO L93 Difference]: Finished difference Result 598 states and 644 transitions. [2021-12-18 20:50:22,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 20:50:22,700 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 4.458333333333333) internal successors, (107), 21 states have internal predecessors, (107), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2021-12-18 20:50:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:50:22,702 INFO L225 Difference]: With dead ends: 598 [2021-12-18 20:50:22,702 INFO L226 Difference]: Without dead ends: 598 [2021-12-18 20:50:22,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 199 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=840, Unknown=2, NotChecked=60, Total=1056 [2021-12-18 20:50:22,703 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 1826 mSDsluCounter, 2329 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1827 SdHoareTripleChecker+Valid, 2517 SdHoareTripleChecker+Invalid, 3442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2288 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 20:50:22,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1827 Valid, 2517 Invalid, 3442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1072 Invalid, 0 Unknown, 2288 Unchecked, 0.5s Time] [2021-12-18 20:50:22,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-12-18 20:50:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 451. [2021-12-18 20:50:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 316 states have (on average 1.7468354430379747) internal successors, (552), 432 states have internal predecessors, (552), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-18 20:50:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 582 transitions. [2021-12-18 20:50:22,711 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 582 transitions. Word has length 105 [2021-12-18 20:50:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:50:22,711 INFO L470 AbstractCegarLoop]: Abstraction has 451 states and 582 transitions. [2021-12-18 20:50:22,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 4.458333333333333) internal successors, (107), 21 states have internal predecessors, (107), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-18 20:50:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 582 transitions. [2021-12-18 20:50:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-12-18 20:50:22,713 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:50:22,713 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:50:22,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-18 20:50:22,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:50:22,935 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:50:22,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:50:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash -943842599, now seen corresponding path program 1 times [2021-12-18 20:50:22,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:50:22,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343842007] [2021-12-18 20:50:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:50:22,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:50:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:25,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 20:50:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:25,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-18 20:50:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:26,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 20:50:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:26,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 20:50:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:26,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 20:50:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:27,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 20:50:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:27,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 20:50:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:27,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 20:50:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:27,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-18 20:50:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:28,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-12-18 20:50:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-12-18 20:50:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:28,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-12-18 20:50:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:28,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2021-12-18 20:50:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:29,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2021-12-18 20:50:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 21 proven. 751 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2021-12-18 20:50:29,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:50:29,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343842007] [2021-12-18 20:50:29,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343842007] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:50:29,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073295194] [2021-12-18 20:50:29,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:50:29,774 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:50:29,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:50:29,780 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:50:29,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-18 20:50:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:50:30,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 2131 conjuncts, 427 conjunts are in the unsatisfiable core [2021-12-18 20:50:30,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:50:30,511 INFO L388 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 [2021-12-18 20:50:30,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:50:30,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:30,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:50:30,813 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:50:30,813 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2021-12-18 20:50:30,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:30,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-18 20:50:30,875 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:50:30,875 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2021-12-18 20:50:30,945 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-18 20:50:30,945 INFO L388 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 15 [2021-12-18 20:50:31,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:31,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:31,626 INFO L354 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2021-12-18 20:50:31,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 103 treesize of output 104 [2021-12-18 20:50:31,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:31,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 82 [2021-12-18 20:50:31,655 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-18 20:50:31,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-18 20:50:31,668 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-12-18 20:50:31,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2021-12-18 20:50:32,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:32,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:32,323 INFO L354 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2021-12-18 20:50:32,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 101 [2021-12-18 20:50:32,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:32,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 83 [2021-12-18 20:50:32,358 INFO L354 Elim1Store]: treesize reduction 77, result has 30.6 percent of original size [2021-12-18 20:50:32,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2021-12-18 20:50:32,380 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-18 20:50:32,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2021-12-18 20:50:33,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:33,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:33,158 INFO L354 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2021-12-18 20:50:33,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 120 [2021-12-18 20:50:33,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:33,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 92 [2021-12-18 20:50:33,187 INFO L354 Elim1Store]: treesize reduction 77, result has 30.6 percent of original size [2021-12-18 20:50:33,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2021-12-18 20:50:33,219 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-18 20:50:33,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2021-12-18 20:50:33,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:33,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:33,861 INFO L354 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2021-12-18 20:50:33,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 126 [2021-12-18 20:50:33,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:33,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 96 [2021-12-18 20:50:33,899 INFO L354 Elim1Store]: treesize reduction 107, result has 31.4 percent of original size [2021-12-18 20:50:33,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 72 [2021-12-18 20:50:33,930 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-18 20:50:33,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2021-12-18 20:50:34,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:34,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:34,568 INFO L354 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2021-12-18 20:50:34,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 141 treesize of output 134 [2021-12-18 20:50:34,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:34,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 100 [2021-12-18 20:50:34,606 INFO L354 Elim1Store]: treesize reduction 107, result has 31.4 percent of original size [2021-12-18 20:50:34,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 72 [2021-12-18 20:50:34,624 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-18 20:50:34,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2021-12-18 20:50:35,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:35,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:35,475 INFO L354 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2021-12-18 20:50:35,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 149 treesize of output 140 [2021-12-18 20:50:35,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:35,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 104 [2021-12-18 20:50:35,534 INFO L354 Elim1Store]: treesize reduction 137, result has 31.8 percent of original size [2021-12-18 20:50:35,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 90 [2021-12-18 20:50:35,552 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-18 20:50:35,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2021-12-18 20:50:36,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:36,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:36,460 INFO L354 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2021-12-18 20:50:36,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 167 treesize of output 154 [2021-12-18 20:50:36,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:36,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 112 [2021-12-18 20:50:36,544 INFO L354 Elim1Store]: treesize reduction 175, result has 31.1 percent of original size [2021-12-18 20:50:36,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 53 treesize of output 108 [2021-12-18 20:50:36,569 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-18 20:50:36,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2021-12-18 20:50:37,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:37,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:37,431 INFO L354 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2021-12-18 20:50:37,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 185 treesize of output 168 [2021-12-18 20:50:37,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:37,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 120 [2021-12-18 20:50:37,536 INFO L354 Elim1Store]: treesize reduction 213, result has 30.6 percent of original size [2021-12-18 20:50:37,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 58 treesize of output 126 [2021-12-18 20:50:37,575 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-18 20:50:37,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2021-12-18 20:50:41,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:41,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:41,880 INFO L354 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2021-12-18 20:50:41,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 203 treesize of output 182 [2021-12-18 20:50:41,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:41,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 128 [2021-12-18 20:50:42,014 INFO L354 Elim1Store]: treesize reduction 251, result has 30.3 percent of original size [2021-12-18 20:50:42,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 17 case distinctions, treesize of input 63 treesize of output 144 [2021-12-18 20:50:42,057 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-18 20:50:42,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2021-12-18 20:50:46,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:46,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:46,426 INFO L354 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2021-12-18 20:50:46,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 221 treesize of output 196 [2021-12-18 20:50:46,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:50:46,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 136 [2021-12-18 20:50:46,553 INFO L354 Elim1Store]: treesize reduction 289, result has 30.0 percent of original size [2021-12-18 20:50:46,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 31 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 68 treesize of output 162 [2021-12-18 20:50:46,593 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-18 20:50:46,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 21 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2021-12-18 20:51:00,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:51:00,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:51:00,696 INFO L354 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2021-12-18 20:51:00,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 239 treesize of output 210 [2021-12-18 20:51:00,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:51:00,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 144 [2021-12-18 20:51:00,841 INFO L354 Elim1Store]: treesize reduction 327, result has 29.8 percent of original size [2021-12-18 20:51:00,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 39 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 23 case distinctions, treesize of input 73 treesize of output 180 [2021-12-18 20:51:00,895 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-18 20:51:00,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 24 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2021-12-18 20:51:22,075 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-12-18 20:51:22,076 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-12-18 20:51:22,076 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 20:51:22,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2021-12-18 20:51:22,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-12-18 20:51:22,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466741513] [2021-12-18 20:51:22,077 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 20:51:22,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-18 20:51:22,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:51:22,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-18 20:51:22,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=4823, Unknown=48, NotChecked=0, Total=5256 [2021-12-18 20:51:22,079 INFO L87 Difference]: Start difference. First operand 451 states and 582 transitions. Second operand has 36 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 2 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-18 20:51:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 20:51:22,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 227 SyntacticMatches, 69 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4421 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=385, Invalid=4823, Unknown=48, NotChecked=0, Total=5256 [2021-12-18 20:51:22,081 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:22,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:51:22,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:22,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-18 20:51:22,292 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@4c4b7ff7 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-18 20:51:22,296 INFO L158 Benchmark]: Toolchain (without parser) took 153608.28ms. Allocated memory was 90.2MB in the beginning and 564.1MB in the end (delta: 474.0MB). Free memory was 56.1MB in the beginning and 380.4MB in the end (delta: -324.3MB). Peak memory consumption was 148.2MB. Max. memory is 16.1GB. [2021-12-18 20:51:22,296 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory was 46.4MB in the beginning and 46.4MB in the end (delta: 39.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 20:51:22,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.66ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 55.9MB in the beginning and 87.7MB in the end (delta: -31.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-18 20:51:22,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.21ms. Allocated memory is still 121.6MB. Free memory was 87.7MB in the beginning and 85.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 20:51:22,296 INFO L158 Benchmark]: Boogie Preprocessor took 48.96ms. Allocated memory is still 121.6MB. Free memory was 85.1MB in the beginning and 82.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 20:51:22,296 INFO L158 Benchmark]: RCFGBuilder took 748.57ms. Allocated memory is still 121.6MB. Free memory was 82.3MB in the beginning and 46.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-12-18 20:51:22,297 INFO L158 Benchmark]: TraceAbstraction took 152345.00ms. Allocated memory was 121.6MB in the beginning and 564.1MB in the end (delta: 442.5MB). Free memory was 46.5MB in the beginning and 380.4MB in the end (delta: -333.9MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. [2021-12-18 20:51:22,297 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory was 46.4MB in the beginning and 46.4MB in the end (delta: 39.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.66ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 55.9MB in the beginning and 87.7MB in the end (delta: -31.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.21ms. Allocated memory is still 121.6MB. Free memory was 87.7MB in the beginning and 85.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.96ms. Allocated memory is still 121.6MB. Free memory was 85.1MB in the beginning and 82.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 748.57ms. Allocated memory is still 121.6MB. Free memory was 82.3MB in the beginning and 46.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 152345.00ms. Allocated memory was 121.6MB in the beginning and 564.1MB in the end (delta: 442.5MB). Free memory was 46.5MB in the beginning and 380.4MB in the end (delta: -333.9MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@4c4b7ff7 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@4c4b7ff7: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 20:51:24,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 20:51:24,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 20:51:24,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 20:51:24,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 20:51:24,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 20:51:24,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 20:51:24,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 20:51:24,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 20:51:24,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 20:51:24,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 20:51:24,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 20:51:24,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 20:51:24,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 20:51:24,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 20:51:24,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 20:51:24,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 20:51:24,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 20:51:24,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 20:51:24,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 20:51:24,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 20:51:24,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 20:51:24,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 20:51:24,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 20:51:24,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 20:51:24,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 20:51:24,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 20:51:24,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 20:51:24,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 20:51:24,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 20:51:24,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 20:51:24,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 20:51:24,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 20:51:24,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 20:51:24,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 20:51:24,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 20:51:24,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 20:51:24,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 20:51:24,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 20:51:24,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 20:51:24,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 20:51:24,119 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-18 20:51:24,152 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 20:51:24,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 20:51:24,153 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 20:51:24,154 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 20:51:24,154 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 20:51:24,155 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 20:51:24,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 20:51:24,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 20:51:24,156 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 20:51:24,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 20:51:24,157 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 20:51:24,157 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 20:51:24,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 20:51:24,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 20:51:24,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 20:51:24,158 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 20:51:24,158 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 20:51:24,158 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 20:51:24,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 20:51:24,159 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 20:51:24,159 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 20:51:24,159 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 20:51:24,159 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 20:51:24,159 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 20:51:24,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 20:51:24,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 20:51:24,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 20:51:24,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:51:24,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 20:51:24,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 20:51:24,169 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 20:51:24,169 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 20:51:24,170 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 20:51:24,170 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 20:51:24,170 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 [2021-12-18 20:51:24,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 20:51:24,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 20:51:24,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 20:51:24,478 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 20:51:24,478 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 20:51:24,479 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2021-12-18 20:51:24,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/975fee892/a8606deee20945d685c26cce72adddfb/FLAG0694d4c89 [2021-12-18 20:51:25,039 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 20:51:25,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2021-12-18 20:51:25,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/975fee892/a8606deee20945d685c26cce72adddfb/FLAG0694d4c89 [2021-12-18 20:51:25,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/975fee892/a8606deee20945d685c26cce72adddfb [2021-12-18 20:51:25,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 20:51:25,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 20:51:25,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 20:51:25,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 20:51:25,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 20:51:25,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:51:25" (1/1) ... [2021-12-18 20:51:25,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102af891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:25, skipping insertion in model container [2021-12-18 20:51:25,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:51:25" (1/1) ... [2021-12-18 20:51:25,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 20:51:25,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 20:51:25,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:51:25,812 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 20:51:25,855 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:51:25,880 INFO L208 MainTranslator]: Completed translation [2021-12-18 20:51:25,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:25 WrapperNode [2021-12-18 20:51:25,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 20:51:25,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 20:51:25,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 20:51:25,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 20:51:25,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:25" (1/1) ... [2021-12-18 20:51:25,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:25" (1/1) ... [2021-12-18 20:51:25,934 INFO L137 Inliner]: procedures = 126, calls = 94, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 294 [2021-12-18 20:51:25,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 20:51:25,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 20:51:25,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 20:51:25,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 20:51:25,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:25" (1/1) ... [2021-12-18 20:51:25,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:25" (1/1) ... [2021-12-18 20:51:25,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:25" (1/1) ... [2021-12-18 20:51:25,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:25" (1/1) ... [2021-12-18 20:51:25,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:25" (1/1) ... [2021-12-18 20:51:25,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:25" (1/1) ... [2021-12-18 20:51:25,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:25" (1/1) ... [2021-12-18 20:51:25,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 20:51:25,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 20:51:25,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 20:51:25,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 20:51:25,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:25" (1/1) ... [2021-12-18 20:51:25,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:51:26,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:51:26,012 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) [2021-12-18 20:51:26,015 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 [2021-12-18 20:51:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-18 20:51:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 20:51:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 20:51:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 20:51:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 20:51:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-12-18 20:51:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 20:51:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 20:51:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 20:51:26,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 20:51:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure append [2021-12-18 20:51:26,047 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2021-12-18 20:51:26,147 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 20:51:26,148 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 20:51:27,123 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 20:51:27,131 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 20:51:27,131 INFO L301 CfgBuilder]: Removed 11 assume(true) statements. [2021-12-18 20:51:27,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:51:27 BoogieIcfgContainer [2021-12-18 20:51:27,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 20:51:27,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 20:51:27,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 20:51:27,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 20:51:27,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:51:25" (1/3) ... [2021-12-18 20:51:27,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c11644e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:51:27, skipping insertion in model container [2021-12-18 20:51:27,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:51:25" (2/3) ... [2021-12-18 20:51:27,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c11644e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:51:27, skipping insertion in model container [2021-12-18 20:51:27,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:51:27" (3/3) ... [2021-12-18 20:51:27,139 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2021-12-18 20:51:27,149 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 20:51:27,149 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2021-12-18 20:51:27,198 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 20:51:27,206 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 20:51:27,206 INFO L340 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2021-12-18 20:51:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 157 states have (on average 2.159235668789809) internal successors, (339), 306 states have internal predecessors, (339), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-18 20:51:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 20:51:27,240 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:27,240 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 20:51:27,241 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:51:27,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-18 20:51:27,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:51:27,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600460941] [2021-12-18 20:51:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:27,256 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:51:27,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:51:27,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:51:27,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-18 20:51:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:27,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 20:51:27,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:27,432 INFO L388 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 [2021-12-18 20:51:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:27,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:51:27,448 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:51:27,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600460941] [2021-12-18 20:51:27,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600460941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:27,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:27,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:51:27,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534212022] [2021-12-18 20:51:27,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:27,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:51:27,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:51:27,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:51:27,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:51:27,486 INFO L87 Difference]: Start difference. First operand has 320 states, 157 states have (on average 2.159235668789809) internal successors, (339), 306 states have internal predecessors, (339), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:28,217 INFO L93 Difference]: Finished difference Result 545 states and 598 transitions. [2021-12-18 20:51:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:51:28,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-18 20:51:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:28,232 INFO L225 Difference]: With dead ends: 545 [2021-12-18 20:51:28,232 INFO L226 Difference]: Without dead ends: 543 [2021-12-18 20:51:28,233 INFO L932 BasicCegarLoop]: 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 [2021-12-18 20:51:28,236 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 246 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:28,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 443 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-18 20:51:28,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-12-18 20:51:28,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 404. [2021-12-18 20:51:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 244 states have (on average 2.1024590163934427) internal successors, (513), 390 states have internal predecessors, (513), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-18 20:51:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 541 transitions. [2021-12-18 20:51:28,300 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 541 transitions. Word has length 3 [2021-12-18 20:51:28,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:28,300 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 541 transitions. [2021-12-18 20:51:28,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 541 transitions. [2021-12-18 20:51:28,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 20:51:28,301 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:28,301 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 20:51:28,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-18 20:51:28,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:51:28,502 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:51:28,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:28,503 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-18 20:51:28,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:51:28,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414688740] [2021-12-18 20:51:28,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:28,504 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:51:28,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:51:28,505 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:51:28,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-18 20:51:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:28,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 20:51:28,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:28,563 INFO L388 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 [2021-12-18 20:51:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:28,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:51:28,572 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:51:28,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414688740] [2021-12-18 20:51:28,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414688740] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:28,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:28,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:51:28,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434237476] [2021-12-18 20:51:28,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:28,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:51:28,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:51:28,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:51:28,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:51:28,575 INFO L87 Difference]: Start difference. First operand 404 states and 541 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:29,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:29,005 INFO L93 Difference]: Finished difference Result 405 states and 544 transitions. [2021-12-18 20:51:29,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:51:29,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-18 20:51:29,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:29,008 INFO L225 Difference]: With dead ends: 405 [2021-12-18 20:51:29,008 INFO L226 Difference]: Without dead ends: 405 [2021-12-18 20:51:29,008 INFO L932 BasicCegarLoop]: 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 [2021-12-18 20:51:29,009 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 6 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:29,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 561 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 20:51:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-12-18 20:51:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2021-12-18 20:51:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 244 states have (on average 2.0942622950819674) internal successors, (511), 388 states have internal predecessors, (511), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-18 20:51:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 539 transitions. [2021-12-18 20:51:29,035 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 539 transitions. Word has length 3 [2021-12-18 20:51:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:29,035 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 539 transitions. [2021-12-18 20:51:29,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 539 transitions. [2021-12-18 20:51:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 20:51:29,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:29,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:29,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:29,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:51:29,244 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:51:29,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:29,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1117387183, now seen corresponding path program 1 times [2021-12-18 20:51:29,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:51:29,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656602024] [2021-12-18 20:51:29,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:29,246 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:51:29,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:51:29,247 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:51:29,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-18 20:51:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:29,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 20:51:29,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:29,363 INFO L388 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 [2021-12-18 20:51:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:29,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:51:29,369 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:51:29,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656602024] [2021-12-18 20:51:29,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656602024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:29,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:29,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:51:29,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178552921] [2021-12-18 20:51:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:29,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:51:29,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:51:29,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:51:29,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:51:29,377 INFO L87 Difference]: Start difference. First operand 402 states and 539 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:29,703 INFO L93 Difference]: Finished difference Result 397 states and 534 transitions. [2021-12-18 20:51:29,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:51:29,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-18 20:51:29,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:29,706 INFO L225 Difference]: With dead ends: 397 [2021-12-18 20:51:29,706 INFO L226 Difference]: Without dead ends: 397 [2021-12-18 20:51:29,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:51:29,707 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 43 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:29,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 491 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 20:51:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-12-18 20:51:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2021-12-18 20:51:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 244 states have (on average 2.0737704918032787) internal successors, (506), 383 states have internal predecessors, (506), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-18 20:51:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 534 transitions. [2021-12-18 20:51:29,726 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 534 transitions. Word has length 10 [2021-12-18 20:51:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:29,727 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 534 transitions. [2021-12-18 20:51:29,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 534 transitions. [2021-12-18 20:51:29,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 20:51:29,727 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:29,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:29,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:29,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:51:29,928 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:51:29,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:29,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1117387184, now seen corresponding path program 1 times [2021-12-18 20:51:29,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:51:29,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802966180] [2021-12-18 20:51:29,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:29,930 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:51:29,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:51:29,931 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:51:29,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-18 20:51:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:29,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 20:51:29,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:30,033 INFO L388 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 [2021-12-18 20:51:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:30,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:51:30,040 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:51:30,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802966180] [2021-12-18 20:51:30,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802966180] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:30,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:30,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:51:30,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985779766] [2021-12-18 20:51:30,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:30,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:51:30,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:51:30,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:51:30,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:51:30,043 INFO L87 Difference]: Start difference. First operand 397 states and 534 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:30,410 INFO L93 Difference]: Finished difference Result 392 states and 529 transitions. [2021-12-18 20:51:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:51:30,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-18 20:51:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:30,413 INFO L225 Difference]: With dead ends: 392 [2021-12-18 20:51:30,413 INFO L226 Difference]: Without dead ends: 392 [2021-12-18 20:51:30,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:51:30,415 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 38 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:30,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 504 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 20:51:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-12-18 20:51:30,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2021-12-18 20:51:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 244 states have (on average 2.05327868852459) internal successors, (501), 378 states have internal predecessors, (501), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-18 20:51:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 529 transitions. [2021-12-18 20:51:30,426 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 529 transitions. Word has length 10 [2021-12-18 20:51:30,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:30,426 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 529 transitions. [2021-12-18 20:51:30,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 529 transitions. [2021-12-18 20:51:30,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 20:51:30,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:30,427 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:30,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:30,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:51:30,636 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:51:30,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:30,637 INFO L85 PathProgramCache]: Analyzing trace with hash 279264727, now seen corresponding path program 1 times [2021-12-18 20:51:30,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:51:30,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585912457] [2021-12-18 20:51:30,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:30,638 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:51:30,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:51:30,639 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:51:30,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-18 20:51:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:30,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 20:51:30,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:30,731 INFO L388 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 [2021-12-18 20:51:30,779 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-18 20:51:30,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2021-12-18 20:51:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:30,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:51:30,797 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:51:30,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585912457] [2021-12-18 20:51:30,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585912457] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:30,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:30,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:51:30,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608858712] [2021-12-18 20:51:30,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:30,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:51:30,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:51:30,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:51:30,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:51:30,799 INFO L87 Difference]: Start difference. First operand 392 states and 529 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:31,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:31,537 INFO L93 Difference]: Finished difference Result 520 states and 571 transitions. [2021-12-18 20:51:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:51:31,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-18 20:51:31,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:31,540 INFO L225 Difference]: With dead ends: 520 [2021-12-18 20:51:31,540 INFO L226 Difference]: Without dead ends: 520 [2021-12-18 20:51:31,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:51:31,541 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 314 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:31,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 639 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-18 20:51:31,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-12-18 20:51:31,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 384. [2021-12-18 20:51:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 244 states have (on average 2.0204918032786887) internal successors, (493), 370 states have internal predecessors, (493), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-18 20:51:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 521 transitions. [2021-12-18 20:51:31,555 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 521 transitions. Word has length 11 [2021-12-18 20:51:31,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:31,556 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 521 transitions. [2021-12-18 20:51:31,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 521 transitions. [2021-12-18 20:51:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 20:51:31,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:31,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:31,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:31,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:51:31,766 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:51:31,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash 279264728, now seen corresponding path program 1 times [2021-12-18 20:51:31,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:51:31,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653681444] [2021-12-18 20:51:31,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:31,768 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:51:31,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:51:31,769 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:51:31,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-18 20:51:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:31,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-18 20:51:31,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:31,866 INFO L388 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 [2021-12-18 20:51:31,872 INFO L388 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 [2021-12-18 20:51:32,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:51:32,005 INFO L388 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 [2021-12-18 20:51:32,015 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:51:32,015 INFO L388 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 14 treesize of output 14 [2021-12-18 20:51:32,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:32,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:51:32,037 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:51:32,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653681444] [2021-12-18 20:51:32,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653681444] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:32,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:32,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:51:32,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942396242] [2021-12-18 20:51:32,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:32,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:51:32,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:51:32,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:51:32,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:51:32,039 INFO L87 Difference]: Start difference. First operand 384 states and 521 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:33,221 INFO L93 Difference]: Finished difference Result 511 states and 562 transitions. [2021-12-18 20:51:33,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:51:33,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-18 20:51:33,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:33,223 INFO L225 Difference]: With dead ends: 511 [2021-12-18 20:51:33,224 INFO L226 Difference]: Without dead ends: 511 [2021-12-18 20:51:33,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:51:33,225 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 298 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:33,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 443 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-18 20:51:33,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-12-18 20:51:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 376. [2021-12-18 20:51:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 244 states have (on average 1.9836065573770492) internal successors, (484), 362 states have internal predecessors, (484), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-18 20:51:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 512 transitions. [2021-12-18 20:51:33,244 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 512 transitions. Word has length 11 [2021-12-18 20:51:33,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:33,244 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 512 transitions. [2021-12-18 20:51:33,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:33,244 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 512 transitions. [2021-12-18 20:51:33,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 20:51:33,245 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:33,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:33,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:33,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:51:33,456 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:51:33,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:33,457 INFO L85 PathProgramCache]: Analyzing trace with hash 314804234, now seen corresponding path program 1 times [2021-12-18 20:51:33,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:51:33,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537639886] [2021-12-18 20:51:33,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:33,457 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:51:33,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:51:33,458 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:51:33,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 20:51:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:33,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-18 20:51:33,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:33,584 INFO L388 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 [2021-12-18 20:51:33,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:51:33,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:51:33,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:51:33,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:51:33,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:51:33,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:51:33,753 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:51:33,754 INFO L388 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 14 treesize of output 14 [2021-12-18 20:51:33,794 INFO L388 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 [2021-12-18 20:51:33,805 INFO L388 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 [2021-12-18 20:51:33,833 INFO L388 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 [2021-12-18 20:51:33,838 INFO L388 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 [2021-12-18 20:51:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:33,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:51:33,880 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:51:33,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537639886] [2021-12-18 20:51:33,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537639886] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:33,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:33,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 20:51:33,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829808698] [2021-12-18 20:51:33,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:33,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 20:51:33,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:51:33,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 20:51:33,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-18 20:51:33,883 INFO L87 Difference]: Start difference. First operand 376 states and 512 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:34,668 INFO L93 Difference]: Finished difference Result 396 states and 535 transitions. [2021-12-18 20:51:34,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 20:51:34,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-18 20:51:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:34,671 INFO L225 Difference]: With dead ends: 396 [2021-12-18 20:51:34,671 INFO L226 Difference]: Without dead ends: 396 [2021-12-18 20:51:34,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-18 20:51:34,672 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 25 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:34,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 1838 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-18 20:51:34,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-12-18 20:51:34,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 384. [2021-12-18 20:51:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 251 states have (on average 1.9601593625498008) internal successors, (492), 369 states have internal predecessors, (492), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-18 20:51:34,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 522 transitions. [2021-12-18 20:51:34,684 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 522 transitions. Word has length 20 [2021-12-18 20:51:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:34,685 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 522 transitions. [2021-12-18 20:51:34,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 522 transitions. [2021-12-18 20:51:34,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 20:51:34,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:34,686 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:34,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:34,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:51:34,897 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:51:34,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:34,898 INFO L85 PathProgramCache]: Analyzing trace with hash -54530483, now seen corresponding path program 1 times [2021-12-18 20:51:34,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:51:34,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830499250] [2021-12-18 20:51:34,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:34,899 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:51:34,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:51:34,900 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:51:34,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-18 20:51:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:35,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-18 20:51:35,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:35,025 INFO L388 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 [2021-12-18 20:51:35,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:51:35,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:51:35,148 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:51:35,148 INFO L388 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 14 treesize of output 14 [2021-12-18 20:51:35,192 INFO L388 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 [2021-12-18 20:51:35,198 INFO L388 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 [2021-12-18 20:51:35,249 INFO L388 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 [2021-12-18 20:51:35,252 INFO L388 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 [2021-12-18 20:51:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:51:35,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:51:35,296 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:51:35,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830499250] [2021-12-18 20:51:35,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830499250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:51:35,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:35,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 20:51:35,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642072597] [2021-12-18 20:51:35,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:51:35,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 20:51:35,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:51:35,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 20:51:35,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-18 20:51:35,298 INFO L87 Difference]: Start difference. First operand 384 states and 522 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:36,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:51:36,531 INFO L93 Difference]: Finished difference Result 524 states and 577 transitions. [2021-12-18 20:51:36,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 20:51:36,531 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-18 20:51:36,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:51:36,533 INFO L225 Difference]: With dead ends: 524 [2021-12-18 20:51:36,533 INFO L226 Difference]: Without dead ends: 524 [2021-12-18 20:51:36,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-18 20:51:36,534 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 249 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:51:36,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 1362 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-18 20:51:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-12-18 20:51:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 387. [2021-12-18 20:51:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 254 states have (on average 1.9488188976377954) internal successors, (495), 372 states have internal predecessors, (495), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-18 20:51:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 525 transitions. [2021-12-18 20:51:36,546 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 525 transitions. Word has length 22 [2021-12-18 20:51:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:51:36,546 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 525 transitions. [2021-12-18 20:51:36,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:51:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 525 transitions. [2021-12-18 20:51:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 20:51:36,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:51:36,548 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:36,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:36,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:51:36,759 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 143 more)] === [2021-12-18 20:51:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:51:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash 67877176, now seen corresponding path program 1 times [2021-12-18 20:51:36,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:51:36,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151840703] [2021-12-18 20:51:36,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:36,761 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:51:36,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:51:36,762 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:51:36,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-18 20:51:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:51:36,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-18 20:51:36,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:51:37,002 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-18 20:51:37,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2021-12-18 20:51:37,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:51:37,414 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:51:37,414 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-18 20:51:37,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 20:51:37,509 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:51:37,509 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2021-12-18 20:51:37,699 INFO L354 Elim1Store]: treesize reduction 120, result has 25.5 percent of original size [2021-12-18 20:51:37,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 86 [2021-12-18 20:51:37,754 INFO L354 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2021-12-18 20:51:37,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 54 [2021-12-18 20:51:38,077 INFO L354 Elim1Store]: treesize reduction 85, result has 36.6 percent of original size [2021-12-18 20:51:38,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 52 treesize of output 85 [2021-12-18 20:51:38,391 INFO L388 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 75 treesize of output 71 [2021-12-18 20:51:38,395 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:51:38,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151840703] [2021-12-18 20:51:38,396 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-18 20:51:38,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [257721812] [2021-12-18 20:51:38,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:38,396 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 20:51:38,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 20:51:38,400 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 20:51:38,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2021-12-18 20:51:38,486 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@544d573b at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-18 20:51:38,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682794911] [2021-12-18 20:51:38,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:51:38,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:51:38,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:51:38,495 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) [2021-12-18 20:51:38,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-18 20:51:38,550 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@544d573b at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-18 20:51:38,552 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:51:38,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-12-18 20:51:38,552 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-12-18 20:51:38,552 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-12-18 20:51:38,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr22REQUIRES_VIOLATION (146 of 147 remaining) [2021-12-18 20:51:38,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (145 of 147 remaining) [2021-12-18 20:51:38,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (144 of 147 remaining) [2021-12-18 20:51:38,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (143 of 147 remaining) [2021-12-18 20:51:38,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (142 of 147 remaining) [2021-12-18 20:51:38,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (141 of 147 remaining) [2021-12-18 20:51:38,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (140 of 147 remaining) [2021-12-18 20:51:38,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (139 of 147 remaining) [2021-12-18 20:51:38,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (138 of 147 remaining) [2021-12-18 20:51:38,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (137 of 147 remaining) [2021-12-18 20:51:38,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (136 of 147 remaining) [2021-12-18 20:51:38,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (135 of 147 remaining) [2021-12-18 20:51:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (134 of 147 remaining) [2021-12-18 20:51:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (133 of 147 remaining) [2021-12-18 20:51:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (132 of 147 remaining) [2021-12-18 20:51:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (131 of 147 remaining) [2021-12-18 20:51:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (130 of 147 remaining) [2021-12-18 20:51:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (129 of 147 remaining) [2021-12-18 20:51:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (128 of 147 remaining) [2021-12-18 20:51:38,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (127 of 147 remaining) [2021-12-18 20:51:38,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (126 of 147 remaining) [2021-12-18 20:51:38,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (125 of 147 remaining) [2021-12-18 20:51:38,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (124 of 147 remaining) [2021-12-18 20:51:38,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (123 of 147 remaining) [2021-12-18 20:51:38,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (122 of 147 remaining) [2021-12-18 20:51:38,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (121 of 147 remaining) [2021-12-18 20:51:38,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (120 of 147 remaining) [2021-12-18 20:51:38,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (119 of 147 remaining) [2021-12-18 20:51:38,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (118 of 147 remaining) [2021-12-18 20:51:38,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (117 of 147 remaining) [2021-12-18 20:51:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (116 of 147 remaining) [2021-12-18 20:51:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (115 of 147 remaining) [2021-12-18 20:51:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (114 of 147 remaining) [2021-12-18 20:51:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (113 of 147 remaining) [2021-12-18 20:51:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (112 of 147 remaining) [2021-12-18 20:51:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (111 of 147 remaining) [2021-12-18 20:51:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (110 of 147 remaining) [2021-12-18 20:51:38,566 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (109 of 147 remaining) [2021-12-18 20:51:38,566 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (108 of 147 remaining) [2021-12-18 20:51:38,566 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (107 of 147 remaining) [2021-12-18 20:51:38,566 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (106 of 147 remaining) [2021-12-18 20:51:38,566 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (105 of 147 remaining) [2021-12-18 20:51:38,566 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (104 of 147 remaining) [2021-12-18 20:51:38,566 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (103 of 147 remaining) [2021-12-18 20:51:38,567 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (102 of 147 remaining) [2021-12-18 20:51:38,567 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (101 of 147 remaining) [2021-12-18 20:51:38,567 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (100 of 147 remaining) [2021-12-18 20:51:38,567 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (99 of 147 remaining) [2021-12-18 20:51:38,567 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (98 of 147 remaining) [2021-12-18 20:51:38,567 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (97 of 147 remaining) [2021-12-18 20:51:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (96 of 147 remaining) [2021-12-18 20:51:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (95 of 147 remaining) [2021-12-18 20:51:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (94 of 147 remaining) [2021-12-18 20:51:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (93 of 147 remaining) [2021-12-18 20:51:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (92 of 147 remaining) [2021-12-18 20:51:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE (91 of 147 remaining) [2021-12-18 20:51:38,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (90 of 147 remaining) [2021-12-18 20:51:38,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (89 of 147 remaining) [2021-12-18 20:51:38,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (88 of 147 remaining) [2021-12-18 20:51:38,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (87 of 147 remaining) [2021-12-18 20:51:38,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (86 of 147 remaining) [2021-12-18 20:51:38,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (85 of 147 remaining) [2021-12-18 20:51:38,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION (84 of 147 remaining) [2021-12-18 20:51:38,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION (83 of 147 remaining) [2021-12-18 20:51:38,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION (82 of 147 remaining) [2021-12-18 20:51:38,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION (81 of 147 remaining) [2021-12-18 20:51:38,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION (80 of 147 remaining) [2021-12-18 20:51:38,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION (79 of 147 remaining) [2021-12-18 20:51:38,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION (78 of 147 remaining) [2021-12-18 20:51:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION (77 of 147 remaining) [2021-12-18 20:51:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION (76 of 147 remaining) [2021-12-18 20:51:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION (75 of 147 remaining) [2021-12-18 20:51:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION (74 of 147 remaining) [2021-12-18 20:51:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION (73 of 147 remaining) [2021-12-18 20:51:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION (72 of 147 remaining) [2021-12-18 20:51:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION (71 of 147 remaining) [2021-12-18 20:51:38,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION (70 of 147 remaining) [2021-12-18 20:51:38,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION (69 of 147 remaining) [2021-12-18 20:51:38,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION (68 of 147 remaining) [2021-12-18 20:51:38,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION (67 of 147 remaining) [2021-12-18 20:51:38,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION (66 of 147 remaining) [2021-12-18 20:51:38,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATION (65 of 147 remaining) [2021-12-18 20:51:38,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATION (64 of 147 remaining) [2021-12-18 20:51:38,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION (63 of 147 remaining) [2021-12-18 20:51:38,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION (62 of 147 remaining) [2021-12-18 20:51:38,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATION (61 of 147 remaining) [2021-12-18 20:51:38,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION (60 of 147 remaining) [2021-12-18 20:51:38,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION (59 of 147 remaining) [2021-12-18 20:51:38,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION (58 of 147 remaining) [2021-12-18 20:51:38,574 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION (57 of 147 remaining) [2021-12-18 20:51:38,574 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATION (56 of 147 remaining) [2021-12-18 20:51:38,574 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION (55 of 147 remaining) [2021-12-18 20:51:38,574 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION (54 of 147 remaining) [2021-12-18 20:51:38,574 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATION (53 of 147 remaining) [2021-12-18 20:51:38,574 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION (52 of 147 remaining) [2021-12-18 20:51:38,575 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION (51 of 147 remaining) [2021-12-18 20:51:38,575 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95REQUIRES_VIOLATION (50 of 147 remaining) [2021-12-18 20:51:38,575 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION (49 of 147 remaining) [2021-12-18 20:51:38,575 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION (48 of 147 remaining) [2021-12-18 20:51:38,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATION (47 of 147 remaining) [2021-12-18 20:51:38,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99REQUIRES_VIOLATION (46 of 147 remaining) [2021-12-18 20:51:38,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100REQUIRES_VIOLATION (45 of 147 remaining) [2021-12-18 20:51:38,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101REQUIRES_VIOLATION (44 of 147 remaining) [2021-12-18 20:51:38,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102REQUIRES_VIOLATION (43 of 147 remaining) [2021-12-18 20:51:38,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103REQUIRES_VIOLATION (42 of 147 remaining) [2021-12-18 20:51:38,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONMEMORY_FREE (41 of 147 remaining) [2021-12-18 20:51:38,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONMEMORY_FREE (40 of 147 remaining) [2021-12-18 20:51:38,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONMEMORY_FREE (39 of 147 remaining) [2021-12-18 20:51:38,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107REQUIRES_VIOLATION (38 of 147 remaining) [2021-12-18 20:51:38,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108REQUIRES_VIOLATION (37 of 147 remaining) [2021-12-18 20:51:38,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONMEMORY_FREE (36 of 147 remaining) [2021-12-18 20:51:38,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_FREE (35 of 147 remaining) [2021-12-18 20:51:38,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONMEMORY_FREE (34 of 147 remaining) [2021-12-18 20:51:38,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION (33 of 147 remaining) [2021-12-18 20:51:38,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION (32 of 147 remaining) [2021-12-18 20:51:38,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONMEMORY_FREE (31 of 147 remaining) [2021-12-18 20:51:38,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONMEMORY_FREE (30 of 147 remaining) [2021-12-18 20:51:38,579 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONMEMORY_FREE (29 of 147 remaining) [2021-12-18 20:51:38,579 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONMEMORY_FREE (28 of 147 remaining) [2021-12-18 20:51:38,579 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE (27 of 147 remaining) [2021-12-18 20:51:38,579 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE (26 of 147 remaining) [2021-12-18 20:51:38,579 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_LEAK (25 of 147 remaining) [2021-12-18 20:51:38,579 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr0REQUIRES_VIOLATION (24 of 147 remaining) [2021-12-18 20:51:38,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr1REQUIRES_VIOLATION (23 of 147 remaining) [2021-12-18 20:51:38,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr2REQUIRES_VIOLATION (22 of 147 remaining) [2021-12-18 20:51:38,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr3REQUIRES_VIOLATION (21 of 147 remaining) [2021-12-18 20:51:38,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr4REQUIRES_VIOLATION (20 of 147 remaining) [2021-12-18 20:51:38,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr5REQUIRES_VIOLATION (19 of 147 remaining) [2021-12-18 20:51:38,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr6REQUIRES_VIOLATION (18 of 147 remaining) [2021-12-18 20:51:38,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr7REQUIRES_VIOLATION (17 of 147 remaining) [2021-12-18 20:51:38,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr8REQUIRES_VIOLATION (16 of 147 remaining) [2021-12-18 20:51:38,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr9REQUIRES_VIOLATION (15 of 147 remaining) [2021-12-18 20:51:38,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr10REQUIRES_VIOLATION (14 of 147 remaining) [2021-12-18 20:51:38,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr11REQUIRES_VIOLATION (13 of 147 remaining) [2021-12-18 20:51:38,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr12REQUIRES_VIOLATION (12 of 147 remaining) [2021-12-18 20:51:38,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr13REQUIRES_VIOLATION (11 of 147 remaining) [2021-12-18 20:51:38,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr14REQUIRES_VIOLATION (10 of 147 remaining) [2021-12-18 20:51:38,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr15REQUIRES_VIOLATION (9 of 147 remaining) [2021-12-18 20:51:38,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr16REQUIRES_VIOLATION (8 of 147 remaining) [2021-12-18 20:51:38,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr17REQUIRES_VIOLATION (7 of 147 remaining) [2021-12-18 20:51:38,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr18REQUIRES_VIOLATION (6 of 147 remaining) [2021-12-18 20:51:38,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr19REQUIRES_VIOLATION (5 of 147 remaining) [2021-12-18 20:51:38,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr20REQUIRES_VIOLATION (4 of 147 remaining) [2021-12-18 20:51:38,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr21REQUIRES_VIOLATION (3 of 147 remaining) [2021-12-18 20:51:38,583 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr23REQUIRES_VIOLATION (2 of 147 remaining) [2021-12-18 20:51:38,583 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr24REQUIRES_VIOLATION (1 of 147 remaining) [2021-12-18 20:51:38,583 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr25REQUIRES_VIOLATION (0 of 147 remaining) [2021-12-18 20:51:38,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:38,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:39,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-18 20:51:39,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:51:39,208 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:51:39,211 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 20:51:39,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:51:39 BoogieIcfgContainer [2021-12-18 20:51:39,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 20:51:39,232 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 20:51:39,232 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 20:51:39,232 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 20:51:39,233 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:51:27" (3/4) ... [2021-12-18 20:51:39,235 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-18 20:51:39,235 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 20:51:39,236 INFO L158 Benchmark]: Toolchain (without parser) took 13724.41ms. Allocated memory was 54.5MB in the beginning and 83.9MB in the end (delta: 29.4MB). Free memory was 30.2MB in the beginning and 44.5MB in the end (delta: -14.3MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2021-12-18 20:51:39,238 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.4MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 20:51:39,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.11ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 30.0MB in the beginning and 42.3MB in the end (delta: -12.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2021-12-18 20:51:39,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.31ms. Allocated memory is still 69.2MB. Free memory was 42.3MB in the beginning and 39.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 20:51:39,239 INFO L158 Benchmark]: Boogie Preprocessor took 48.71ms. Allocated memory is still 69.2MB. Free memory was 39.3MB in the beginning and 50.1MB in the end (delta: -10.9MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2021-12-18 20:51:39,239 INFO L158 Benchmark]: RCFGBuilder took 1148.06ms. Allocated memory is still 69.2MB. Free memory was 50.1MB in the beginning and 43.9MB in the end (delta: 6.2MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2021-12-18 20:51:39,240 INFO L158 Benchmark]: TraceAbstraction took 12097.09ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 43.3MB in the beginning and 44.5MB in the end (delta: -1.2MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2021-12-18 20:51:39,240 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 83.9MB. Free memory is still 44.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 20:51:39,242 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.4MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.11ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 30.0MB in the beginning and 42.3MB in the end (delta: -12.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.31ms. Allocated memory is still 69.2MB. Free memory was 42.3MB in the beginning and 39.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.71ms. Allocated memory is still 69.2MB. Free memory was 39.3MB in the beginning and 50.1MB in the end (delta: -10.9MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1148.06ms. Allocated memory is still 69.2MB. Free memory was 50.1MB in the beginning and 43.9MB in the end (delta: 6.2MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12097.09ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 43.3MB in the beginning and 44.5MB in the end (delta: -1.2MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 83.9MB. Free memory is still 44.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L574] struct list_t *list = malloc(sizeof *list); [L575] list->first = ((void *)0) [L576] list->last = ((void *)0) [L577] char userInput; [L579] char userInput = __VERIFIER_nondet_char(); [L580] COND FALSE !((userInput == '<') || (userInput == '>')) [L583] CALL append(list, userInput) [L559] struct node_t *node = malloc(sizeof *node); [L560] node->data = input [L561] EXPR head->first [L561] head->first == ((void *)0) && head->last == ((void *)0) [L561] EXPR head->last [L561] head->first == ((void *)0) && head->last == ((void *)0) [L561] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L562] head->first = node [L563] head->last= node [L564] node->prev = ((void *)0) [L565] node->next = ((void *)0) [L583] RET append(list, userInput) [L584] COND FALSE !(__VERIFIER_nondet_int()) [L585] CALL append(list, '<') [L559] struct node_t *node = malloc(sizeof *node); [L560] node->data = input [L561] EXPR head->first [L561] head->first == ((void *)0) && head->last == ((void *)0) [L561] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L568] EXPR head->last [L568] node->prev = head->last [L569] node->next = ((void *)0) [L570] EXPR head->last [L570] head->last->next = node - UnprovableResult [Line: 575]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 611]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 611]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 622]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 622]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 627]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 627]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 632]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 632]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 638]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 638]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 638]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 641]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 641]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 641]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 320 locations, 147 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1219 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1219 mSDsluCounter, 6281 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4219 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3336 IncrementalHoareTripleChecker+Invalid, 3439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 2062 mSDtfsCounter, 3336 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=1, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 562 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 754 SizeOfPredicates, 32 NumberOfNonLiveVariables, 909 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-18 20:51:39,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN