./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all.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/list-simple/sll2c_update_all.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 e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 22:08:12,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 22:08:12,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 22:08:12,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 22:08:12,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 22:08:12,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 22:08:12,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 22:08:12,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 22:08:12,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 22:08:12,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 22:08:12,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 22:08:12,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 22:08:12,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 22:08:12,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 22:08:12,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 22:08:12,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 22:08:12,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 22:08:12,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 22:08:12,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 22:08:12,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 22:08:12,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 22:08:12,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 22:08:12,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 22:08:12,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 22:08:12,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 22:08:12,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 22:08:12,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 22:08:12,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 22:08:12,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 22:08:12,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 22:08:12,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 22:08:12,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 22:08:12,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 22:08:12,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 22:08:12,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 22:08:12,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 22:08:12,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 22:08:12,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 22:08:12,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 22:08:12,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 22:08:12,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 22:08:12,828 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 22:08:12,840 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 22:08:12,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 22:08:12,841 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 22:08:12,841 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 22:08:12,841 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 22:08:12,842 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 22:08:12,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 22:08:12,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 22:08:12,842 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 22:08:12,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 22:08:12,843 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 22:08:12,843 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 22:08:12,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 22:08:12,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 22:08:12,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 22:08:12,843 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 22:08:12,843 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 22:08:12,843 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 22:08:12,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 22:08:12,844 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 22:08:12,844 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 22:08:12,844 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 22:08:12,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 22:08:12,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 22:08:12,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 22:08:12,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:08:12,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 22:08:12,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 22:08:12,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 22:08:12,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 22:08:12,845 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 22:08:12,845 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2021-12-18 22:08:13,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 22:08:13,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 22:08:13,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 22:08:13,054 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 22:08:13,055 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 22:08:13,056 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-18 22:08:13,115 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee08a7b1f/2526d7503b57435092752bd2225afb84/FLAG31246ca8d [2021-12-18 22:08:13,468 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 22:08:13,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-18 22:08:13,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee08a7b1f/2526d7503b57435092752bd2225afb84/FLAG31246ca8d [2021-12-18 22:08:13,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee08a7b1f/2526d7503b57435092752bd2225afb84 [2021-12-18 22:08:13,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 22:08:13,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 22:08:13,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 22:08:13,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 22:08:13,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 22:08:13,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:08:13" (1/1) ... [2021-12-18 22:08:13,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eac588d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:13, skipping insertion in model container [2021-12-18 22:08:13,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:08:13" (1/1) ... [2021-12-18 22:08:13,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 22:08:13,888 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 22:08:14,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-12-18 22:08:14,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:08:14,137 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 22:08:14,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-12-18 22:08:14,160 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:08:14,180 INFO L208 MainTranslator]: Completed translation [2021-12-18 22:08:14,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:14 WrapperNode [2021-12-18 22:08:14,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 22:08:14,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 22:08:14,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 22:08:14,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 22:08:14,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:14" (1/1) ... [2021-12-18 22:08:14,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:14" (1/1) ... [2021-12-18 22:08:14,208 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2021-12-18 22:08:14,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 22:08:14,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 22:08:14,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 22:08:14,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 22:08:14,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:14" (1/1) ... [2021-12-18 22:08:14,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:14" (1/1) ... [2021-12-18 22:08:14,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:14" (1/1) ... [2021-12-18 22:08:14,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:14" (1/1) ... [2021-12-18 22:08:14,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:14" (1/1) ... [2021-12-18 22:08:14,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:14" (1/1) ... [2021-12-18 22:08:14,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:14" (1/1) ... [2021-12-18 22:08:14,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 22:08:14,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 22:08:14,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 22:08:14,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 22:08:14,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:14" (1/1) ... [2021-12-18 22:08:14,232 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:08:14,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:14,249 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 22:08:14,279 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 22:08:14,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 22:08:14,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 22:08:14,305 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-18 22:08:14,305 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-18 22:08:14,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 22:08:14,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 22:08:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 22:08:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 22:08:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 22:08:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 22:08:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 22:08:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 22:08:14,442 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 22:08:14,443 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 22:08:14,691 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 22:08:14,697 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 22:08:14,698 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-18 22:08:14,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:14 BoogieIcfgContainer [2021-12-18 22:08:14,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 22:08:14,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 22:08:14,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 22:08:14,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 22:08:14,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:08:13" (1/3) ... [2021-12-18 22:08:14,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f5cad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:14, skipping insertion in model container [2021-12-18 22:08:14,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:14" (2/3) ... [2021-12-18 22:08:14,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f5cad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:14, skipping insertion in model container [2021-12-18 22:08:14,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:14" (3/3) ... [2021-12-18 22:08:14,707 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2021-12-18 22:08:14,710 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 22:08:14,711 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-18 22:08:14,742 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 22:08:14,749 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 22:08:14,749 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-18 22:08:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 22:08:14,771 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:14,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 22:08:14,772 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:14,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:14,776 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2021-12-18 22:08:14,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:14,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895651391] [2021-12-18 22:08:14,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:14,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:14,898 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 22:08:14,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:14,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895651391] [2021-12-18 22:08:14,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895651391] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:14,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:14,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:08:14,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373811940] [2021-12-18 22:08:14,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:14,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:08:14,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:14,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:08:14,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:08:14,942 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 22:08:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:15,015 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2021-12-18 22:08:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:08:15,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2021-12-18 22:08:15,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:15,026 INFO L225 Difference]: With dead ends: 81 [2021-12-18 22:08:15,026 INFO L226 Difference]: Without dead ends: 78 [2021-12-18 22:08:15,027 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 22:08:15,031 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:15,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:15,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-18 22:08:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-18 22:08:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2021-12-18 22:08:15,066 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2021-12-18 22:08:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:15,066 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2021-12-18 22:08:15,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 22:08:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-12-18 22:08:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 22:08:15,067 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:15,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 22:08:15,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 22:08:15,068 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:15,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2021-12-18 22:08:15,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:15,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077248571] [2021-12-18 22:08:15,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:15,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:15,128 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 22:08:15,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:15,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077248571] [2021-12-18 22:08:15,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077248571] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:15,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:15,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:08:15,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457199077] [2021-12-18 22:08:15,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:15,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:08:15,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:15,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:08:15,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:08:15,134 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 22:08:15,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:15,181 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2021-12-18 22:08:15,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:08:15,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2021-12-18 22:08:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:15,184 INFO L225 Difference]: With dead ends: 76 [2021-12-18 22:08:15,185 INFO L226 Difference]: Without dead ends: 76 [2021-12-18 22:08:15,185 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 22:08:15,186 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:15,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:15,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-18 22:08:15,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-18 22:08:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-18 22:08:15,191 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2021-12-18 22:08:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:15,191 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-18 22:08:15,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 22:08:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-18 22:08:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 22:08:15,192 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:15,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:15,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 22:08:15,193 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:15,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:15,193 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2021-12-18 22:08:15,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:15,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029115068] [2021-12-18 22:08:15,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:15,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:15,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:15,246 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 22:08:15,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:15,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029115068] [2021-12-18 22:08:15,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029115068] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:15,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:15,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 22:08:15,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213057679] [2021-12-18 22:08:15,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:15,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 22:08:15,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:15,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 22:08:15,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 22:08:15,248 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 22:08:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:15,290 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-12-18 22:08:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 22:08:15,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-12-18 22:08:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:15,292 INFO L225 Difference]: With dead ends: 83 [2021-12-18 22:08:15,292 INFO L226 Difference]: Without dead ends: 83 [2021-12-18 22:08:15,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 22:08:15,293 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:15,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-18 22:08:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2021-12-18 22:08:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2021-12-18 22:08:15,317 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2021-12-18 22:08:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:15,317 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2021-12-18 22:08:15,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 22:08:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2021-12-18 22:08:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 22:08:15,318 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:15,318 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:15,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 22:08:15,318 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:15,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:15,319 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2021-12-18 22:08:15,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:15,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090332860] [2021-12-18 22:08:15,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:15,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:15,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:15,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:08:15,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:15,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090332860] [2021-12-18 22:08:15,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090332860] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:15,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:15,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 22:08:15,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123127468] [2021-12-18 22:08:15,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:15,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 22:08:15,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:15,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 22:08:15,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:08:15,397 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:15,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:15,494 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-12-18 22:08:15,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 22:08:15,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-18 22:08:15,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:15,496 INFO L225 Difference]: With dead ends: 97 [2021-12-18 22:08:15,496 INFO L226 Difference]: Without dead ends: 97 [2021-12-18 22:08:15,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:08:15,497 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:15,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 268 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:15,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-18 22:08:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2021-12-18 22:08:15,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-18 22:08:15,502 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2021-12-18 22:08:15,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:15,502 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-18 22:08:15,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-18 22:08:15,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 22:08:15,503 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:15,503 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:15,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 22:08:15,503 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:15,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:15,504 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2021-12-18 22:08:15,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:15,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742551125] [2021-12-18 22:08:15,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:15,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:15,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:15,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:15,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:15,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742551125] [2021-12-18 22:08:15,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742551125] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:15,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:15,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 22:08:15,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915587015] [2021-12-18 22:08:15,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:15,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 22:08:15,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:15,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 22:08:15,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:08:15,606 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:15,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:15,700 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2021-12-18 22:08:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 22:08:15,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-18 22:08:15,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:15,701 INFO L225 Difference]: With dead ends: 76 [2021-12-18 22:08:15,702 INFO L226 Difference]: Without dead ends: 76 [2021-12-18 22:08:15,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:08:15,703 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:15,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:15,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-18 22:08:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-12-18 22:08:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2021-12-18 22:08:15,706 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2021-12-18 22:08:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:15,707 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2021-12-18 22:08:15,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:15,707 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2021-12-18 22:08:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 22:08:15,708 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:15,708 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:15,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 22:08:15,708 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:15,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:15,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2021-12-18 22:08:15,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:15,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859637041] [2021-12-18 22:08:15,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:15,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:15,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:15,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 22:08:15,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:15,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859637041] [2021-12-18 22:08:15,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859637041] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:15,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425170841] [2021-12-18 22:08:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:15,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:15,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:15,825 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 22:08:15,826 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 22:08:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:15,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-18 22:08:15,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:15,976 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 22:08:16,121 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 22:08:16,122 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 17 treesize of output 21 [2021-12-18 22:08:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:16,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:16,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425170841] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:16,179 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:08:16,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-12-18 22:08:16,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026625243] [2021-12-18 22:08:16,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:16,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 22:08:16,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:16,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 22:08:16,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-18 22:08:16,181 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:08:16,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:16,283 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-12-18 22:08:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 22:08:16,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-12-18 22:08:16,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:16,284 INFO L225 Difference]: With dead ends: 94 [2021-12-18 22:08:16,284 INFO L226 Difference]: Without dead ends: 94 [2021-12-18 22:08:16,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-18 22:08:16,285 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 67 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:16,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 355 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2021-12-18 22:08:16,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-18 22:08:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2021-12-18 22:08:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2021-12-18 22:08:16,289 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2021-12-18 22:08:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:16,290 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2021-12-18 22:08:16,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:08:16,290 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2021-12-18 22:08:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 22:08:16,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:16,291 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:16,310 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 22:08:16,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-18 22:08:16,508 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:16,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2021-12-18 22:08:16,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:16,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466769829] [2021-12-18 22:08:16,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:16,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:16,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:16,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 22:08:16,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:16,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466769829] [2021-12-18 22:08:16,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466769829] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:16,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554865069] [2021-12-18 22:08:16,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:16,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:16,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:16,631 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 22:08:16,649 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 22:08:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:16,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-18 22:08:16,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:16,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 22:08:16,735 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 22:08:16,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:08:16,928 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 22:08:16,934 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:08:16,935 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 22:08:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:08:16,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:17,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554865069] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:17,055 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:08:17,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-12-18 22:08:17,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931500518] [2021-12-18 22:08:17,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:17,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-18 22:08:17,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-18 22:08:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-12-18 22:08:17,057 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-18 22:08:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:17,285 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2021-12-18 22:08:17,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 22:08:17,287 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2021-12-18 22:08:17,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:17,288 INFO L225 Difference]: With dead ends: 94 [2021-12-18 22:08:17,288 INFO L226 Difference]: Without dead ends: 94 [2021-12-18 22:08:17,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-12-18 22:08:17,288 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 139 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:17,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 460 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 282 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2021-12-18 22:08:17,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-18 22:08:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2021-12-18 22:08:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2021-12-18 22:08:17,291 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 25 [2021-12-18 22:08:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:17,292 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2021-12-18 22:08:17,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-18 22:08:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2021-12-18 22:08:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 22:08:17,292 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:17,292 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:17,323 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 22:08:17,503 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,SelfDestructingSolverStorable6 [2021-12-18 22:08:17,504 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2021-12-18 22:08:17,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:17,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404051999] [2021-12-18 22:08:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:17,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:17,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:17,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:17,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:08:17,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:17,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404051999] [2021-12-18 22:08:17,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404051999] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:17,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:17,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 22:08:17,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568492651] [2021-12-18 22:08:17,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:17,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 22:08:17,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:17,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 22:08:17,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:08:17,620 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:17,832 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2021-12-18 22:08:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 22:08:17,832 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-18 22:08:17,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:17,833 INFO L225 Difference]: With dead ends: 142 [2021-12-18 22:08:17,833 INFO L226 Difference]: Without dead ends: 142 [2021-12-18 22:08:17,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:08:17,834 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 312 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:17,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 479 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 22:08:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-18 22:08:17,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 76. [2021-12-18 22:08:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:17,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2021-12-18 22:08:17,838 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 30 [2021-12-18 22:08:17,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:17,838 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2021-12-18 22:08:17,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2021-12-18 22:08:17,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 22:08:17,839 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:17,839 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:17,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 22:08:17,839 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:17,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:17,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2021-12-18 22:08:17,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:17,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465315494] [2021-12-18 22:08:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:17,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:17,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:17,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:18,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:18,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465315494] [2021-12-18 22:08:18,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465315494] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:18,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:18,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 22:08:18,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198238319] [2021-12-18 22:08:18,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:18,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 22:08:18,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:18,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 22:08:18,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:08:18,004 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:18,227 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2021-12-18 22:08:18,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 22:08:18,227 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-18 22:08:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:18,228 INFO L225 Difference]: With dead ends: 123 [2021-12-18 22:08:18,228 INFO L226 Difference]: Without dead ends: 123 [2021-12-18 22:08:18,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:08:18,229 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 323 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:18,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 485 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 22:08:18,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-18 22:08:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 76. [2021-12-18 22:08:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.509433962264151) internal successors, (80), 72 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2021-12-18 22:08:18,232 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 30 [2021-12-18 22:08:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:18,232 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2021-12-18 22:08:18,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2021-12-18 22:08:18,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 22:08:18,232 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:18,232 INFO L514 BasicCegarLoop]: trace histogram [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 22:08:18,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 22:08:18,233 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:18,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:18,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333178, now seen corresponding path program 1 times [2021-12-18 22:08:18,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:18,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914279433] [2021-12-18 22:08:18,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:18,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:18,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:18,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:18,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:18,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914279433] [2021-12-18 22:08:18,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914279433] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:18,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:18,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 22:08:18,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043504538] [2021-12-18 22:08:18,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:18,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:08:18,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:18,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:08:18,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:08:18,295 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:18,347 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2021-12-18 22:08:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:08:18,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-18 22:08:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:18,348 INFO L225 Difference]: With dead ends: 155 [2021-12-18 22:08:18,348 INFO L226 Difference]: Without dead ends: 155 [2021-12-18 22:08:18,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 22:08:18,349 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 87 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:18,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 297 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:18,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-18 22:08:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 78. [2021-12-18 22:08:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.509090909090909) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2021-12-18 22:08:18,352 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 32 [2021-12-18 22:08:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:18,352 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2021-12-18 22:08:18,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2021-12-18 22:08:18,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 22:08:18,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:18,353 INFO L514 BasicCegarLoop]: trace histogram [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 22:08:18,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 22:08:18,354 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:18,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:18,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333233, now seen corresponding path program 1 times [2021-12-18 22:08:18,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:18,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168239924] [2021-12-18 22:08:18,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:18,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:18,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:08:18,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:18,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168239924] [2021-12-18 22:08:18,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168239924] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:18,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:18,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 22:08:18,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859213138] [2021-12-18 22:08:18,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:18,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 22:08:18,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:18,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 22:08:18,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:08:18,439 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:18,625 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2021-12-18 22:08:18,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 22:08:18,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-18 22:08:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:18,626 INFO L225 Difference]: With dead ends: 130 [2021-12-18 22:08:18,626 INFO L226 Difference]: Without dead ends: 130 [2021-12-18 22:08:18,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:08:18,627 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 296 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:18,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 412 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-18 22:08:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 81. [2021-12-18 22:08:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 77 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2021-12-18 22:08:18,636 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 32 [2021-12-18 22:08:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:18,636 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2021-12-18 22:08:18,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2021-12-18 22:08:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 22:08:18,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:18,639 INFO L514 BasicCegarLoop]: trace histogram [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 22:08:18,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 22:08:18,640 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:18,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333232, now seen corresponding path program 1 times [2021-12-18 22:08:18,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:18,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194626646] [2021-12-18 22:08:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:18,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:18,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:18,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 22:08:18,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:18,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194626646] [2021-12-18 22:08:18,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194626646] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:18,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320712311] [2021-12-18 22:08:18,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:18,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:18,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:18,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:08:18,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-18 22:08:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:18,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 22:08:18,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:18,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:08:18,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320712311] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:18,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 22:08:18,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2021-12-18 22:08:18,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032111328] [2021-12-18 22:08:18,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:18,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 22:08:18,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:18,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 22:08:18,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:08:18,876 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:18,888 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2021-12-18 22:08:18,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 22:08:18,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-18 22:08:18,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:18,889 INFO L225 Difference]: With dead ends: 103 [2021-12-18 22:08:18,889 INFO L226 Difference]: Without dead ends: 103 [2021-12-18 22:08:18,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:08:18,890 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 99 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:18,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 141 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-18 22:08:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2021-12-18 22:08:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 78 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2021-12-18 22:08:18,892 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 32 [2021-12-18 22:08:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:18,893 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2021-12-18 22:08:18,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2021-12-18 22:08:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-18 22:08:18,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:18,893 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-18 22:08:18,925 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 22:08:19,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:19,111 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:19,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:19,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2021-12-18 22:08:19,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:19,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739613918] [2021-12-18 22:08:19,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:19,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:19,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:19,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:19,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:19,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739613918] [2021-12-18 22:08:19,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739613918] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:19,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:19,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 22:08:19,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465554292] [2021-12-18 22:08:19,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:19,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:08:19,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:19,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:08:19,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:08:19,158 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:19,203 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2021-12-18 22:08:19,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:08:19,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2021-12-18 22:08:19,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:19,204 INFO L225 Difference]: With dead ends: 150 [2021-12-18 22:08:19,204 INFO L226 Difference]: Without dead ends: 150 [2021-12-18 22:08:19,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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 22:08:19,205 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 80 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:19,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 258 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-18 22:08:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 83. [2021-12-18 22:08:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.5) internal successors, (90), 79 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2021-12-18 22:08:19,207 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 33 [2021-12-18 22:08:19,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:19,207 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2021-12-18 22:08:19,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2021-12-18 22:08:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 22:08:19,207 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:19,207 INFO L514 BasicCegarLoop]: trace histogram [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 22:08:19,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 22:08:19,208 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:19,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:19,208 INFO L85 PathProgramCache]: Analyzing trace with hash 274321452, now seen corresponding path program 1 times [2021-12-18 22:08:19,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:19,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636102356] [2021-12-18 22:08:19,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:19,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:19,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:19,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 22:08:19,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:19,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636102356] [2021-12-18 22:08:19,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636102356] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:19,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012244628] [2021-12-18 22:08:19,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:19,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:19,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:19,274 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 22:08:19,296 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 22:08:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:19,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:08:19,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:19,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:19,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012244628] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:08:19,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:08:19,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2021-12-18 22:08:19,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805925920] [2021-12-18 22:08:19,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:19,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:08:19,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:19,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:08:19,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:08:19,515 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:08:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:19,576 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2021-12-18 22:08:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 22:08:19,576 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2021-12-18 22:08:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:19,577 INFO L225 Difference]: With dead ends: 130 [2021-12-18 22:08:19,577 INFO L226 Difference]: Without dead ends: 130 [2021-12-18 22:08:19,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:08:19,578 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 175 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:19,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 265 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-18 22:08:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2021-12-18 22:08:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.457142857142857) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2021-12-18 22:08:19,580 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 37 [2021-12-18 22:08:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:19,580 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2021-12-18 22:08:19,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:08:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2021-12-18 22:08:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-18 22:08:19,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:19,581 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-18 22:08:19,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-18 22:08:19,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:19,798 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:19,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:19,798 INFO L85 PathProgramCache]: Analyzing trace with hash -46108703, now seen corresponding path program 1 times [2021-12-18 22:08:19,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:19,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275502412] [2021-12-18 22:08:19,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:19,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:19,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:20,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:20,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:20,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275502412] [2021-12-18 22:08:20,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275502412] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:20,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284732634] [2021-12-18 22:08:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:20,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:20,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:20,078 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 22:08:20,079 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 22:08:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:20,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-18 22:08:20,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:20,202 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 22:08:20,299 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:08:20,299 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 22:08:20,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, 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 22:08:20,353 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:08:20,353 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-18 22:08:20,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:08:20,484 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 31 treesize of output 26 [2021-12-18 22:08:20,538 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 25 treesize of output 13 [2021-12-18 22:08:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:20,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:25,476 INFO L354 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-18 22:08:25,476 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 19 treesize of output 18 [2021-12-18 22:08:25,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2021-12-18 22:08:25,487 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2021-12-18 22:08:25,492 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:08:25,492 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 18 treesize of output 19 [2021-12-18 22:08:25,494 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 30 treesize of output 22 [2021-12-18 22:08:25,496 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 9 treesize of output 7 [2021-12-18 22:08:25,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284732634] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:25,626 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:08:25,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 26 [2021-12-18 22:08:25,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865348927] [2021-12-18 22:08:25,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:25,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-18 22:08:25,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:25,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-18 22:08:25,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=973, Unknown=3, NotChecked=126, Total=1190 [2021-12-18 22:08:25,628 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 23 states have internal predecessors, (49), 2 states have call successors, (4), 3 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 22:08:26,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:26,474 INFO L93 Difference]: Finished difference Result 221 states and 249 transitions. [2021-12-18 22:08:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 22:08:26,474 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 23 states have internal predecessors, (49), 2 states have call successors, (4), 3 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 38 [2021-12-18 22:08:26,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:26,476 INFO L225 Difference]: With dead ends: 221 [2021-12-18 22:08:26,476 INFO L226 Difference]: Without dead ends: 221 [2021-12-18 22:08:26,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=236, Invalid=1661, Unknown=3, NotChecked=170, Total=2070 [2021-12-18 22:08:26,477 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 738 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:26,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [738 Valid, 1053 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 22:08:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-18 22:08:26,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 117. [2021-12-18 22:08:26,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 112 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:08:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2021-12-18 22:08:26,480 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 38 [2021-12-18 22:08:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:26,480 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2021-12-18 22:08:26,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 23 states have internal predecessors, (49), 2 states have call successors, (4), 3 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 22:08:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2021-12-18 22:08:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-18 22:08:26,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:26,481 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-18 22:08:26,515 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 22:08:26,691 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,SelfDestructingSolverStorable14 [2021-12-18 22:08:26,691 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:26,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:26,692 INFO L85 PathProgramCache]: Analyzing trace with hash -46108702, now seen corresponding path program 1 times [2021-12-18 22:08:26,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:26,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660972988] [2021-12-18 22:08:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:26,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:26,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:27,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:27,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:27,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660972988] [2021-12-18 22:08:27,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660972988] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:27,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392297039] [2021-12-18 22:08:27,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:27,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:27,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:27,193 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 22:08:27,195 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 22:08:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:27,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 81 conjunts are in the unsatisfiable core [2021-12-18 22:08:27,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:27,342 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 22:08:27,347 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 22:08:27,653 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 22:08:27,654 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 18 [2021-12-18 22:08:27,672 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:08:27,672 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 22:08:27,757 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 22:08:27,763 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 22:08:27,867 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:08:27,867 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 22:08:27,872 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 25 treesize of output 25 [2021-12-18 22:08:28,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:08:28,068 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 31 treesize of output 26 [2021-12-18 22:08:28,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:08:28,072 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 23 [2021-12-18 22:08:28,152 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 22 treesize of output 10 [2021-12-18 22:08:28,155 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 25 treesize of output 13 [2021-12-18 22:08:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:28,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:30,550 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_14| Int)) (or (and (forall ((v_ArrVal_1172 Int) (v_ArrVal_1174 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_14| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1172) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1174) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1172 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_14| 4) v_ArrVal_1172) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-18 22:08:32,575 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_14| Int)) (or (and (forall ((v_ArrVal_1172 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_14| 4) v_ArrVal_1172) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1174 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_14| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse0 v_ArrVal_1172) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse0 v_ArrVal_1174) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2021-12-18 22:08:34,609 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_14| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_1172 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_14| 4) v_ArrVal_1172) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1174 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_14| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_1172) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_1174) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))) is different from false [2021-12-18 22:08:34,823 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:08:34,823 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 22:08:34,828 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:08:34,828 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 66 [2021-12-18 22:08:34,831 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 99 treesize of output 95 [2021-12-18 22:08:34,834 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 170 treesize of output 162 [2021-12-18 22:08:34,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:08:34,837 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 152 treesize of output 146 [2021-12-18 22:08:34,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:08:34,840 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 131 treesize of output 123 [2021-12-18 22:08:34,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:08:34,845 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 104 treesize of output 100 [2021-12-18 22:08:34,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:08:34,848 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 90 treesize of output 86 [2021-12-18 22:08:34,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:08:34,851 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 81 treesize of output 79 [2021-12-18 22:08:35,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392297039] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:35,106 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:08:35,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2021-12-18 22:08:35,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816594453] [2021-12-18 22:08:35,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:35,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-18 22:08:35,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:35,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-18 22:08:35,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2317, Unknown=4, NotChecked=294, Total=2756 [2021-12-18 22:08:35,108 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-18 22:08:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:36,745 INFO L93 Difference]: Finished difference Result 248 states and 288 transitions. [2021-12-18 22:08:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 22:08:36,746 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2021-12-18 22:08:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:36,747 INFO L225 Difference]: With dead ends: 248 [2021-12-18 22:08:36,747 INFO L226 Difference]: Without dead ends: 248 [2021-12-18 22:08:36,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=302, Invalid=3488, Unknown=4, NotChecked=366, Total=4160 [2021-12-18 22:08:36,748 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 1294 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 2162 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:36,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 2162 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1485 Invalid, 0 Unknown, 120 Unchecked, 0.7s Time] [2021-12-18 22:08:36,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-12-18 22:08:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 125. [2021-12-18 22:08:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 120 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:08:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2021-12-18 22:08:36,751 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 38 [2021-12-18 22:08:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:36,751 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2021-12-18 22:08:36,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-18 22:08:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2021-12-18 22:08:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-18 22:08:36,752 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:36,752 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-18 22:08:36,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-18 22:08:36,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-18 22:08:36,962 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:36,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:36,962 INFO L85 PathProgramCache]: Analyzing trace with hash 766820837, now seen corresponding path program 2 times [2021-12-18 22:08:36,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:36,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982491642] [2021-12-18 22:08:36,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:36,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:37,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:37,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:37,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:37,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982491642] [2021-12-18 22:08:37,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982491642] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:37,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139695550] [2021-12-18 22:08:37,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:08:37,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:37,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:37,045 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 22:08:37,046 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 22:08:37,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:08:37,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:08:37,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:08:37,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:08:37,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:08:37,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139695550] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:08:37,300 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:08:37,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2021-12-18 22:08:37,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426908624] [2021-12-18 22:08:37,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:37,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 22:08:37,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:37,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 22:08:37,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:08:37,302 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:08:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:37,380 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2021-12-18 22:08:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 22:08:37,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-18 22:08:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:37,382 INFO L225 Difference]: With dead ends: 124 [2021-12-18 22:08:37,382 INFO L226 Difference]: Without dead ends: 124 [2021-12-18 22:08:37,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-18 22:08:37,382 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 156 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:37,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 263 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-18 22:08:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2021-12-18 22:08:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 116 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:08:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2021-12-18 22:08:37,385 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 41 [2021-12-18 22:08:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:37,385 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2021-12-18 22:08:37,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:08:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2021-12-18 22:08:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-18 22:08:37,385 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:37,386 INFO L514 BasicCegarLoop]: trace histogram [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 22:08:37,402 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 22:08:37,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:37,595 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:37,596 INFO L85 PathProgramCache]: Analyzing trace with hash -168412912, now seen corresponding path program 2 times [2021-12-18 22:08:37,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:37,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774196744] [2021-12-18 22:08:37,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:37,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:37,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:37,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:37,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:37,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774196744] [2021-12-18 22:08:37,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774196744] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:37,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302497469] [2021-12-18 22:08:37,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:08:37,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:37,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:37,700 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 22:08:37,725 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 22:08:37,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 22:08:37,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:08:37,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-18 22:08:37,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:37,846 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 22:08:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:38,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:08:38,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302497469] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:38,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 22:08:38,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 17 [2021-12-18 22:08:38,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595611711] [2021-12-18 22:08:38,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:38,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 22:08:38,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:38,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 22:08:38,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2021-12-18 22:08:38,084 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:38,279 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2021-12-18 22:08:38,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 22:08:38,279 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2021-12-18 22:08:38,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:38,280 INFO L225 Difference]: With dead ends: 155 [2021-12-18 22:08:38,280 INFO L226 Difference]: Without dead ends: 155 [2021-12-18 22:08:38,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2021-12-18 22:08:38,281 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 524 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:38,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [524 Valid, 273 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:38,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-18 22:08:38,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 121. [2021-12-18 22:08:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 116 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:08:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2021-12-18 22:08:38,286 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 42 [2021-12-18 22:08:38,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:38,287 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2021-12-18 22:08:38,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2021-12-18 22:08:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-18 22:08:38,288 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:38,289 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2021-12-18 22:08:38,308 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 22:08:38,499 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,SelfDestructingSolverStorable17 [2021-12-18 22:08:38,499 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:38,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:38,500 INFO L85 PathProgramCache]: Analyzing trace with hash 790743329, now seen corresponding path program 1 times [2021-12-18 22:08:38,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:38,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798587536] [2021-12-18 22:08:38,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:38,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:38,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:38,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:38,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:38,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798587536] [2021-12-18 22:08:38,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798587536] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:38,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227394753] [2021-12-18 22:08:38,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:38,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:38,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:38,583 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 22:08:38,584 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 22:08:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:38,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:08:38,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:38,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:38,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227394753] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:08:38,867 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:08:38,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2021-12-18 22:08:38,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553957044] [2021-12-18 22:08:38,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:38,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 22:08:38,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:38,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 22:08:38,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:08:38,868 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:08:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:38,996 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2021-12-18 22:08:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:08:38,997 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2021-12-18 22:08:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:38,997 INFO L225 Difference]: With dead ends: 118 [2021-12-18 22:08:38,997 INFO L226 Difference]: Without dead ends: 118 [2021-12-18 22:08:38,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:08:38,998 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 219 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:38,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 459 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:38,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-18 22:08:39,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2021-12-18 22:08:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 94 states have (on average 1.297872340425532) internal successors, (122), 111 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:08:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2021-12-18 22:08:39,000 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 46 [2021-12-18 22:08:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:39,001 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2021-12-18 22:08:39,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:08:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2021-12-18 22:08:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-18 22:08:39,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:39,001 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-12-18 22:08:39,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-18 22:08:39,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:39,211 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:39,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1217170439, now seen corresponding path program 3 times [2021-12-18 22:08:39,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:39,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319943368] [2021-12-18 22:08:39,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:39,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:39,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:39,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:08:39,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:39,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319943368] [2021-12-18 22:08:39,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319943368] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:39,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519845561] [2021-12-18 22:08:39,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 22:08:39,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:39,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:39,282 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 22:08:39,311 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 22:08:39,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-18 22:08:39,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:08:39,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:08:39,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 22:08:39,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 22:08:39,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519845561] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:08:39,640 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:08:39,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2021-12-18 22:08:39,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586527089] [2021-12-18 22:08:39,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:39,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 22:08:39,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:39,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 22:08:39,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-18 22:08:39,641 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:08:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:39,739 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2021-12-18 22:08:39,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 22:08:39,739 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2021-12-18 22:08:39,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:39,740 INFO L225 Difference]: With dead ends: 113 [2021-12-18 22:08:39,740 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 22:08:39,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-12-18 22:08:39,741 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 109 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:39,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 394 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 22:08:39,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2021-12-18 22:08:39,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 103 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:08:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2021-12-18 22:08:39,744 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 46 [2021-12-18 22:08:39,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:39,744 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2021-12-18 22:08:39,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:08:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2021-12-18 22:08:39,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-18 22:08:39,745 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:39,745 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:39,762 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 22:08:39,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:39,947 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:39,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:39,948 INFO L85 PathProgramCache]: Analyzing trace with hash -399124699, now seen corresponding path program 1 times [2021-12-18 22:08:39,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:39,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041502578] [2021-12-18 22:08:39,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:39,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:40,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:40,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:40,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:40,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041502578] [2021-12-18 22:08:40,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041502578] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:40,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490297613] [2021-12-18 22:08:40,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:40,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:40,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:40,592 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 22:08:40,607 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 22:08:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:40,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 94 conjunts are in the unsatisfiable core [2021-12-18 22:08:40,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:40,784 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 22:08:41,002 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:08:41,003 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 22:08:41,074 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 22:08:41,156 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:08:41,157 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-18 22:08:41,329 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-18 22:08:41,330 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 22 treesize of output 21 [2021-12-18 22:08:41,333 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 22:08:41,477 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 16 treesize of output 8 [2021-12-18 22:08:41,573 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 22:08:41,714 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 22:08:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:08:41,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:42,022 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1835 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1835) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1835 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1835) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2021-12-18 22:08:42,034 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1835 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1835) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1835 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1835) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-18 22:08:42,042 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1835 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1835) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1835 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1835) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-18 22:08:42,055 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1835 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1835) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1835 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1835) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2021-12-18 22:08:42,072 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:08:42,073 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 36 treesize of output 37 [2021-12-18 22:08:42,083 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:08:42,083 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 67 [2021-12-18 22:08:42,087 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 25 treesize of output 21 [2021-12-18 22:08:42,126 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:08:42,126 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 36 treesize of output 37 [2021-12-18 22:08:42,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:08:42,130 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 64 treesize of output 52 [2021-12-18 22:08:42,134 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 25 treesize of output 21 [2021-12-18 22:08:42,357 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1831 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_1831) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-18 22:08:42,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1831 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_1831) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-18 22:08:42,367 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:08:42,368 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 24 treesize of output 25 [2021-12-18 22:08:42,369 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 43 treesize of output 39 [2021-12-18 22:08:42,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:08:42,371 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 27 treesize of output 25 [2021-12-18 22:08:42,373 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 45 treesize of output 41 [2021-12-18 22:08:42,713 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-18 22:08:42,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490297613] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:08:42,714 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:08:42,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 27] total 75 [2021-12-18 22:08:42,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560701385] [2021-12-18 22:08:42,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:42,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2021-12-18 22:08:42,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:42,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-12-18 22:08:42,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=4475, Unknown=6, NotChecked=834, Total=5550 [2021-12-18 22:08:42,716 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 75 states, 74 states have (on average 1.6486486486486487) internal successors, (122), 66 states have internal predecessors, (122), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-18 22:08:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:44,662 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2021-12-18 22:08:44,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-18 22:08:44,663 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.6486486486486487) internal successors, (122), 66 states have internal predecessors, (122), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2021-12-18 22:08:44,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:44,663 INFO L225 Difference]: With dead ends: 168 [2021-12-18 22:08:44,663 INFO L226 Difference]: Without dead ends: 168 [2021-12-18 22:08:44,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 97 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1667 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=546, Invalid=8026, Unknown=8, NotChecked=1122, Total=9702 [2021-12-18 22:08:44,665 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 227 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 669 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:44,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 2284 Invalid, 1889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1164 Invalid, 0 Unknown, 669 Unchecked, 0.5s Time] [2021-12-18 22:08:44,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-18 22:08:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 118. [2021-12-18 22:08:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 96 states have (on average 1.25) internal successors, (120), 113 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:08:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2021-12-18 22:08:44,668 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 49 [2021-12-18 22:08:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:44,668 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2021-12-18 22:08:44,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.6486486486486487) internal successors, (122), 66 states have internal predecessors, (122), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-18 22:08:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2021-12-18 22:08:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-18 22:08:44,669 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:44,669 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-12-18 22:08:44,703 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 22:08:44,869 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,SelfDestructingSolverStorable20 [2021-12-18 22:08:44,869 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:44,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash -656821325, now seen corresponding path program 4 times [2021-12-18 22:08:44,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:44,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073060604] [2021-12-18 22:08:44,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:44,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:44,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:44,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:44,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-18 22:08:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-18 22:08:44,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:44,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073060604] [2021-12-18 22:08:44,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073060604] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:44,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312458917] [2021-12-18 22:08:44,926 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-18 22:08:44,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:44,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:44,940 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 22:08:44,940 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 22:08:45,093 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-18 22:08:45,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:08:45,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:08:45,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 22:08:45,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:08:45,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312458917] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:45,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 22:08:45,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-18 22:08:45,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450124374] [2021-12-18 22:08:45,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:45,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 22:08:45,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:45,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 22:08:45,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:08:45,157 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:08:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:45,166 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2021-12-18 22:08:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 22:08:45,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2021-12-18 22:08:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:45,168 INFO L225 Difference]: With dead ends: 87 [2021-12-18 22:08:45,169 INFO L226 Difference]: Without dead ends: 87 [2021-12-18 22:08:45,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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 22:08:45,169 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 58 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:45,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:45,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-18 22:08:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-18 22:08:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2021-12-18 22:08:45,171 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 50 [2021-12-18 22:08:45,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:45,172 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2021-12-18 22:08:45,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:08:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2021-12-18 22:08:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-18 22:08:45,172 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:45,172 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:45,192 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 22:08:45,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-18 22:08:45,390 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:45,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:45,390 INFO L85 PathProgramCache]: Analyzing trace with hash 780049028, now seen corresponding path program 1 times [2021-12-18 22:08:45,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:45,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650762505] [2021-12-18 22:08:45,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:45,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:45,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 22:08:45,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:45,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650762505] [2021-12-18 22:08:45,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650762505] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:45,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399985559] [2021-12-18 22:08:45,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:45,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:45,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:45,519 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 22:08:45,520 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 22:08:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:45,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:08:45,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 22:08:45,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 22:08:45,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399985559] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:08:45,771 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:08:45,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2021-12-18 22:08:45,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40174168] [2021-12-18 22:08:45,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:45,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 22:08:45,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:45,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 22:08:45,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:08:45,773 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:45,855 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2021-12-18 22:08:45,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 22:08:45,855 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2021-12-18 22:08:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:45,856 INFO L225 Difference]: With dead ends: 84 [2021-12-18 22:08:45,856 INFO L226 Difference]: Without dead ends: 84 [2021-12-18 22:08:45,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:08:45,860 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 115 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:45,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 239 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-18 22:08:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-18 22:08:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 80 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2021-12-18 22:08:45,865 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 55 [2021-12-18 22:08:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:45,865 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2021-12-18 22:08:45,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2021-12-18 22:08:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-18 22:08:45,869 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:45,869 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:45,901 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 22:08:46,086 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,SelfDestructingSolverStorable22 [2021-12-18 22:08:46,087 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:46,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash 780048973, now seen corresponding path program 1 times [2021-12-18 22:08:46,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:46,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523076481] [2021-12-18 22:08:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:46,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:46,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:46,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 22:08:46,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:46,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523076481] [2021-12-18 22:08:46,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523076481] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:46,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117053034] [2021-12-18 22:08:46,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:46,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:46,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:46,548 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:08:46,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-18 22:08:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:46,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-18 22:08:46,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:46,722 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 22:08:46,809 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:08:46,810 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 22:08:46,829 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 22:08:46,853 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:08:46,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-18 22:08:46,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:08:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-18 22:08:47,167 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:08:47,167 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-18 22:08:47,278 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 25 treesize of output 13 [2021-12-18 22:08:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 22:08:47,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:47,332 INFO L354 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-18 22:08:47,332 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 19 treesize of output 18 [2021-12-18 22:08:47,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2281) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) is different from false [2021-12-18 22:08:47,341 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2281) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|)) is different from false [2021-12-18 22:08:47,352 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2281) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) is different from false [2021-12-18 22:08:47,358 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2281) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) is different from false [2021-12-18 22:08:47,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2279 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_2279)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_2281) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1)))) is different from false [2021-12-18 22:08:47,380 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2279 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| 4) v_ArrVal_2279))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_2281) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))))) is different from false [2021-12-18 22:08:47,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2279 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| 4) v_ArrVal_2279))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) .cse1 v_ArrVal_2281) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse1))))) is different from false [2021-12-18 22:08:47,398 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2279 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| 4) v_ArrVal_2279))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) .cse1 v_ArrVal_2281) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse1))))) is different from false [2021-12-18 22:08:47,407 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2279 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2278))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| 4) v_ArrVal_2279))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) .cse2 v_ArrVal_2281) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse2)))))) is different from false [2021-12-18 22:08:47,425 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2279 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| Int)) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2278))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| 4) v_ArrVal_2279))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_2281) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse2)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-18 22:08:47,431 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:08:47,431 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 82 treesize of output 59 [2021-12-18 22:08:47,434 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 94 treesize of output 86 [2021-12-18 22:08:47,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:08:47,437 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 18 treesize of output 14 [2021-12-18 22:08:47,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:08:47,440 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 26 treesize of output 20 [2021-12-18 22:08:47,442 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 30 treesize of output 26 [2021-12-18 22:08:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2021-12-18 22:08:47,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117053034] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:08:47,764 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:08:47,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 52 [2021-12-18 22:08:47,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139298222] [2021-12-18 22:08:47,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:47,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-12-18 22:08:47,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:47,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-12-18 22:08:47,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1703, Unknown=10, NotChecked=910, Total=2756 [2021-12-18 22:08:47,765 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 53 states, 52 states have (on average 2.2115384615384617) internal successors, (115), 46 states have internal predecessors, (115), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-18 22:08:47,913 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2279 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| Int)) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2278))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| 4) v_ArrVal_2279))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_2281) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse2)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2021-12-18 22:08:47,915 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2279 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2278))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| 4) v_ArrVal_2279))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2) .cse3 v_ArrVal_2281) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse3)))))) (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) is different from false [2021-12-18 22:08:47,917 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2279 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| 4) v_ArrVal_2279))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) .cse1 v_ArrVal_2281) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse1))))) (= (select |c_#valid| .cse2) 1) (not (= .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) is different from false [2021-12-18 22:08:47,919 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2279 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| 4) v_ArrVal_2279))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse1) .cse2 v_ArrVal_2281) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse2))))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0))) is different from false [2021-12-18 22:08:47,921 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2279 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| 4) v_ArrVal_2279))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse2 v_ArrVal_2281) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse2))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1))) is different from false [2021-12-18 22:08:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:48,469 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-12-18 22:08:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-18 22:08:48,469 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.2115384615384617) internal successors, (115), 46 states have internal predecessors, (115), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2021-12-18 22:08:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:48,470 INFO L225 Difference]: With dead ends: 136 [2021-12-18 22:08:48,470 INFO L226 Difference]: Without dead ends: 136 [2021-12-18 22:08:48,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 76 SyntacticMatches, 12 SemanticMatches, 65 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=242, Invalid=2455, Unknown=15, NotChecked=1710, Total=4422 [2021-12-18 22:08:48,471 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 506 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1280 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:48,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [506 Valid, 1149 Invalid, 2162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 855 Invalid, 0 Unknown, 1280 Unchecked, 0.3s Time] [2021-12-18 22:08:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-18 22:08:48,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 83. [2021-12-18 22:08:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 79 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2021-12-18 22:08:48,473 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 55 [2021-12-18 22:08:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:48,474 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2021-12-18 22:08:48,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.2115384615384617) internal successors, (115), 46 states have internal predecessors, (115), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-18 22:08:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2021-12-18 22:08:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-18 22:08:48,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:48,474 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:48,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-18 22:08:48,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:48,679 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:48,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash 780048974, now seen corresponding path program 1 times [2021-12-18 22:08:48,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:48,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914377047] [2021-12-18 22:08:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:48,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:49,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:49,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 22:08:49,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:49,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914377047] [2021-12-18 22:08:49,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914377047] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:49,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121005966] [2021-12-18 22:08:49,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:49,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:49,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:49,324 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:08:49,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-18 22:08:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:49,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 103 conjunts are in the unsatisfiable core [2021-12-18 22:08:49,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:49,523 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 22:08:49,527 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 22:08:49,854 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:08:49,854 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 22:08:49,860 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: line 427039 column 46: unknown constant v_#length_BEFORE_CALL_6 [2021-12-18 22:08:49,860 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 22:08:49,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-12-18 22:08:49,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979304278] [2021-12-18 22:08:49,861 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:49,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-18 22:08:49,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:49,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-18 22:08:49,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2021-12-18 22:08:49,862 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 26 states, 25 states have (on average 2.04) internal successors, (51), 23 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:49,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 22:08:49,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2021-12-18 22:08:49,863 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 22:08:49,863 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 22:08:49,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-18 22:08:50,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:50,081 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@79886c05 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 22:08:50,084 INFO L158 Benchmark]: Toolchain (without parser) took 36233.91ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 100.1MB in the beginning and 121.7MB in the end (delta: -21.6MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2021-12-18 22:08:50,084 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 44.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 22:08:50,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.35ms. Allocated memory is still 127.9MB. Free memory was 100.1MB in the beginning and 98.5MB in the end (delta: 1.6MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2021-12-18 22:08:50,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.37ms. Allocated memory is still 127.9MB. Free memory was 98.5MB in the beginning and 96.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 22:08:50,085 INFO L158 Benchmark]: Boogie Preprocessor took 17.95ms. Allocated memory is still 127.9MB. Free memory was 96.1MB in the beginning and 94.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 22:08:50,085 INFO L158 Benchmark]: RCFGBuilder took 474.24ms. Allocated memory is still 127.9MB. Free memory was 94.3MB in the beginning and 78.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-18 22:08:50,085 INFO L158 Benchmark]: TraceAbstraction took 35381.95ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 78.0MB in the beginning and 121.7MB in the end (delta: -43.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 22:08:50,086 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.14ms. Allocated memory is still 90.2MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 44.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.35ms. Allocated memory is still 127.9MB. Free memory was 100.1MB in the beginning and 98.5MB in the end (delta: 1.6MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.37ms. Allocated memory is still 127.9MB. Free memory was 98.5MB in the beginning and 96.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.95ms. Allocated memory is still 127.9MB. Free memory was 96.1MB in the beginning and 94.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 474.24ms. Allocated memory is still 127.9MB. Free memory was 94.3MB in the beginning and 78.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 35381.95ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 78.0MB in the beginning and 121.7MB in the end (delta: -43.7MB). There was no memory consumed. 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@79886c05 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@79886c05: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-18 22:08:50,101 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 1 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/list-simple/sll2c_update_all.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 e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 22:08:51,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 22:08:51,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 22:08:51,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 22:08:51,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 22:08:51,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 22:08:51,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 22:08:51,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 22:08:51,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 22:08:51,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 22:08:51,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 22:08:51,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 22:08:51,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 22:08:51,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 22:08:51,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 22:08:51,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 22:08:51,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 22:08:51,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 22:08:51,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 22:08:51,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 22:08:51,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 22:08:51,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 22:08:51,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 22:08:51,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 22:08:51,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 22:08:51,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 22:08:51,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 22:08:51,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 22:08:51,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 22:08:51,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 22:08:51,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 22:08:51,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 22:08:51,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 22:08:51,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 22:08:51,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 22:08:51,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 22:08:51,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 22:08:51,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 22:08:51,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 22:08:51,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 22:08:51,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 22:08:51,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-18 22:08:52,008 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 22:08:52,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 22:08:52,009 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 22:08:52,009 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 22:08:52,009 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 22:08:52,010 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 22:08:52,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 22:08:52,010 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 22:08:52,010 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 22:08:52,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 22:08:52,010 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 22:08:52,010 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 22:08:52,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 22:08:52,011 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 22:08:52,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 22:08:52,011 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 22:08:52,011 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 22:08:52,011 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 22:08:52,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 22:08:52,011 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 22:08:52,011 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 22:08:52,011 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 22:08:52,011 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 22:08:52,011 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 22:08:52,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 22:08:52,012 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 22:08:52,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 22:08:52,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:08:52,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 22:08:52,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 22:08:52,012 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 22:08:52,012 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 22:08:52,012 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 22:08:52,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 22:08:52,013 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2021-12-18 22:08:52,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 22:08:52,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 22:08:52,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 22:08:52,300 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 22:08:52,300 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 22:08:52,302 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-18 22:08:52,346 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6403b3f/f793133bb4304315a294f527e92109c9/FLAG471c822dd [2021-12-18 22:08:52,717 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 22:08:52,718 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-18 22:08:52,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6403b3f/f793133bb4304315a294f527e92109c9/FLAG471c822dd [2021-12-18 22:08:53,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6403b3f/f793133bb4304315a294f527e92109c9 [2021-12-18 22:08:53,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 22:08:53,094 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 22:08:53,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 22:08:53,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 22:08:53,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 22:08:53,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:08:53" (1/1) ... [2021-12-18 22:08:53,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9cb0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:53, skipping insertion in model container [2021-12-18 22:08:53,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:08:53" (1/1) ... [2021-12-18 22:08:53,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 22:08:53,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 22:08:53,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-12-18 22:08:53,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:08:53,410 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 22:08:53,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-12-18 22:08:53,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:08:53,486 INFO L208 MainTranslator]: Completed translation [2021-12-18 22:08:53,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:53 WrapperNode [2021-12-18 22:08:53,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 22:08:53,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 22:08:53,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 22:08:53,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 22:08:53,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:53" (1/1) ... [2021-12-18 22:08:53,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:53" (1/1) ... [2021-12-18 22:08:53,522 INFO L137 Inliner]: procedures = 129, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2021-12-18 22:08:53,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 22:08:53,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 22:08:53,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 22:08:53,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 22:08:53,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:53" (1/1) ... [2021-12-18 22:08:53,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:53" (1/1) ... [2021-12-18 22:08:53,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:53" (1/1) ... [2021-12-18 22:08:53,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:53" (1/1) ... [2021-12-18 22:08:53,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:53" (1/1) ... [2021-12-18 22:08:53,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:53" (1/1) ... [2021-12-18 22:08:53,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:53" (1/1) ... [2021-12-18 22:08:53,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 22:08:53,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 22:08:53,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 22:08:53,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 22:08:53,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:53" (1/1) ... [2021-12-18 22:08:53,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:08:53,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:53,628 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 22:08:53,648 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 22:08:53,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 22:08:53,659 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-18 22:08:53,659 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-18 22:08:53,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 22:08:53,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 22:08:53,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 22:08:53,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 22:08:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 22:08:53,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 22:08:53,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 22:08:53,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 22:08:53,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 22:08:53,805 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 22:08:53,806 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 22:08:54,074 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 22:08:54,079 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 22:08:54,079 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-18 22:08:54,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:54 BoogieIcfgContainer [2021-12-18 22:08:54,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 22:08:54,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 22:08:54,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 22:08:54,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 22:08:54,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:08:53" (1/3) ... [2021-12-18 22:08:54,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0a62b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:54, skipping insertion in model container [2021-12-18 22:08:54,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:53" (2/3) ... [2021-12-18 22:08:54,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0a62b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:54, skipping insertion in model container [2021-12-18 22:08:54,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:54" (3/3) ... [2021-12-18 22:08:54,085 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2021-12-18 22:08:54,099 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 22:08:54,099 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-18 22:08:54,124 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 22:08:54,128 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 22:08:54,128 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-18 22:08:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:54,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 22:08:54,141 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:54,141 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 22:08:54,141 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:54,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:54,144 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2021-12-18 22:08:54,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:08:54,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910426637] [2021-12-18 22:08:54,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:54,152 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:08:54,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:08:54,154 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 22:08:54,160 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 22:08:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:54,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 22:08:54,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:54,296 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 22:08:54,309 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 22:08:54,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:08:54,310 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:08:54,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910426637] [2021-12-18 22:08:54,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910426637] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:54,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:54,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:08:54,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202687869] [2021-12-18 22:08:54,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:54,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:08:54,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:08:54,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:08:54,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:08:54,337 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 22:08:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:54,441 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2021-12-18 22:08:54,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:08:54,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2021-12-18 22:08:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:54,448 INFO L225 Difference]: With dead ends: 81 [2021-12-18 22:08:54,448 INFO L226 Difference]: Without dead ends: 78 [2021-12-18 22:08:54,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 22:08:54,451 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:54,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:54,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-18 22:08:54,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-18 22:08:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2021-12-18 22:08:54,473 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2021-12-18 22:08:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:54,473 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2021-12-18 22:08:54,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 22:08:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-12-18 22:08:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 22:08:54,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:54,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 22:08:54,482 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 22:08:54,680 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 22:08:54,680 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2021-12-18 22:08:54,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:08:54,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255695193] [2021-12-18 22:08:54,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:54,682 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:08:54,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:08:54,683 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 22:08:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:54,726 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 22:08:54,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:08:54,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:54,752 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 22:08:54,766 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 22:08:54,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:08:54,766 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:08:54,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255695193] [2021-12-18 22:08:54,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255695193] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:54,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:54,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:08:54,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072806629] [2021-12-18 22:08:54,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:54,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:08:54,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:08:54,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:08:54,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:08:54,768 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 22:08:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:54,864 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2021-12-18 22:08:54,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:08:54,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2021-12-18 22:08:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:54,865 INFO L225 Difference]: With dead ends: 76 [2021-12-18 22:08:54,865 INFO L226 Difference]: Without dead ends: 76 [2021-12-18 22:08:54,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 22:08:54,867 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:54,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-18 22:08:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-18 22:08:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-18 22:08:54,872 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2021-12-18 22:08:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:54,872 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-18 22:08:54,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 22:08:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-18 22:08:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 22:08:54,873 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:54,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:54,882 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 22:08:55,079 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 22:08:55,080 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2021-12-18 22:08:55,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:08:55,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785350719] [2021-12-18 22:08:55,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:55,081 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:08:55,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:08:55,084 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 22:08:55,086 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 22:08:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:55,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:08:55,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:55,189 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 22:08:55,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:08:55,190 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:08:55,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785350719] [2021-12-18 22:08:55,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785350719] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:55,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:55,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 22:08:55,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348678853] [2021-12-18 22:08:55,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:55,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:08:55,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:08:55,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:08:55,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:08:55,192 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 22:08:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:55,201 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-12-18 22:08:55,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:08:55,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-12-18 22:08:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:55,203 INFO L225 Difference]: With dead ends: 83 [2021-12-18 22:08:55,203 INFO L226 Difference]: Without dead ends: 83 [2021-12-18 22:08:55,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 22:08:55,204 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:55,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 159 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:55,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-18 22:08:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2021-12-18 22:08:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:55,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2021-12-18 22:08:55,210 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2021-12-18 22:08:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:55,211 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2021-12-18 22:08:55,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 22:08:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2021-12-18 22:08:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 22:08:55,212 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:55,212 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:55,220 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 22:08:55,418 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 22:08:55,419 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2021-12-18 22:08:55,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:08:55,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104886558] [2021-12-18 22:08:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:55,421 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:08:55,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:08:55,436 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 22:08:55,436 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 22:08:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:55,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:08:55,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:55,560 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 22:08:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:55,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:08:55,615 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:08:55,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104886558] [2021-12-18 22:08:55,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104886558] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:55,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:55,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 22:08:55,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68023660] [2021-12-18 22:08:55,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:55,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 22:08:55,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:08:55,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 22:08:55,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:08:55,622 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:55,787 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-12-18 22:08:55,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:08:55,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-18 22:08:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:55,789 INFO L225 Difference]: With dead ends: 97 [2021-12-18 22:08:55,789 INFO L226 Difference]: Without dead ends: 97 [2021-12-18 22:08:55,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:08:55,790 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:55,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 227 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-18 22:08:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2021-12-18 22:08:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-18 22:08:55,795 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2021-12-18 22:08:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:55,795 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-18 22:08:55,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-18 22:08:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 22:08:55,795 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:55,795 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:55,820 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 22:08:55,996 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 22:08:55,996 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:55,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2021-12-18 22:08:55,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:08:55,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199011015] [2021-12-18 22:08:55,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:55,998 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:08:55,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:08:55,999 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 22:08:56,001 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 22:08:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:56,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 22:08:56,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:56,105 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 22:08:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:56,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:08:56,191 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:08:56,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199011015] [2021-12-18 22:08:56,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199011015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:56,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:56,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 22:08:56,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463527326] [2021-12-18 22:08:56,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:56,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 22:08:56,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:08:56,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 22:08:56,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:08:56,193 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:56,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:56,404 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2021-12-18 22:08:56,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:08:56,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-18 22:08:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:56,406 INFO L225 Difference]: With dead ends: 76 [2021-12-18 22:08:56,406 INFO L226 Difference]: Without dead ends: 76 [2021-12-18 22:08:56,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:08:56,407 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 69 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:56,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 236 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 22:08:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-18 22:08:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-12-18 22:08:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2021-12-18 22:08:56,410 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2021-12-18 22:08:56,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:56,411 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2021-12-18 22:08:56,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2021-12-18 22:08:56,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 22:08:56,411 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:56,411 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:56,419 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 22:08:56,618 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 22:08:56,618 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:56,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:56,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2021-12-18 22:08:56,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:08:56,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588637253] [2021-12-18 22:08:56,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:56,619 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:08:56,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:08:56,621 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 22:08:56,622 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 22:08:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:56,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 22:08:56,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:56,721 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 22:08:56,868 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 22:08:56,868 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 20 treesize of output 27 [2021-12-18 22:08:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:56,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:57,088 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:08:57,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588637253] [2021-12-18 22:08:57,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588637253] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:08:57,088 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:08:57,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-12-18 22:08:57,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418092935] [2021-12-18 22:08:57,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:57,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:08:57,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:08:57,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:08:57,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:08:57,089 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:08:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:57,251 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2021-12-18 22:08:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 22:08:57,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-12-18 22:08:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:57,252 INFO L225 Difference]: With dead ends: 101 [2021-12-18 22:08:57,252 INFO L226 Difference]: Without dead ends: 101 [2021-12-18 22:08:57,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-18 22:08:57,253 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 62 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:57,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 314 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2021-12-18 22:08:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-18 22:08:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2021-12-18 22:08:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2021-12-18 22:08:57,256 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 25 [2021-12-18 22:08:57,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:57,257 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2021-12-18 22:08:57,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:08:57,257 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2021-12-18 22:08:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 22:08:57,257 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:57,258 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:57,276 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 22:08:57,465 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 22:08:57,466 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:57,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:57,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2021-12-18 22:08:57,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:08:57,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277495656] [2021-12-18 22:08:57,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:57,467 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:08:57,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:08:57,470 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 22:08:57,471 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 22:08:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:57,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 22:08:57,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:57,567 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 22:08:57,573 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 22:08:59,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:08:59,778 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 22:08:59,786 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:08:59,786 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 22:08:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:08:59,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:02,014 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:02,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277495656] [2021-12-18 22:09:02,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277495656] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:02,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [931910954] [2021-12-18 22:09:02,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:02,015 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 22:09:02,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 22:09:02,021 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 22:09:02,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2021-12-18 22:09:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:02,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 22:09:02,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:02,188 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 22:09:02,195 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 22:09:02,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:02,375 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 22:09:02,383 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:09:02,384 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 22:09:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:09:02,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:04,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [931910954] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:04,579 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:04,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-12-18 22:09:04,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278447673] [2021-12-18 22:09:04,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:04,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:09:04,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:04,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:09:04,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=85, Unknown=2, NotChecked=0, Total=110 [2021-12-18 22:09:04,580 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:04,872 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2021-12-18 22:09:04,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 22:09:04,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-12-18 22:09:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:04,874 INFO L225 Difference]: With dead ends: 163 [2021-12-18 22:09:04,874 INFO L226 Difference]: Without dead ends: 163 [2021-12-18 22:09:04,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=31, Invalid=123, Unknown=2, NotChecked=0, Total=156 [2021-12-18 22:09:04,874 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 139 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:04,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 331 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2021-12-18 22:09:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-18 22:09:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 87. [2021-12-18 22:09:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.459016393442623) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:09:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-18 22:09:04,879 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 25 [2021-12-18 22:09:04,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:04,879 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-18 22:09:04,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-18 22:09:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 22:09:04,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:04,880 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:04,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2021-12-18 22:09:05,089 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 22:09:05,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:05,283 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2021-12-18 22:09:05,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:05,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643665184] [2021-12-18 22:09:05,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:05,283 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:05,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:05,285 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 22:09:05,285 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 22:09:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:05,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 22:09:05,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:05,396 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 22:09:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:09:05,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:05,494 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:05,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643665184] [2021-12-18 22:09:05,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643665184] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:05,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:05,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 22:09:05,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993610528] [2021-12-18 22:09:05,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:05,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:09:05,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:05,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:09:05,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:09:05,495 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:05,932 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2021-12-18 22:09:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:09:05,933 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-18 22:09:05,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:05,934 INFO L225 Difference]: With dead ends: 155 [2021-12-18 22:09:05,934 INFO L226 Difference]: Without dead ends: 155 [2021-12-18 22:09:05,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-18 22:09:05,934 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 313 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:05,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 423 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 22:09:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-18 22:09:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 90. [2021-12-18 22:09:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.484375) internal successors, (95), 84 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:09:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2021-12-18 22:09:05,938 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 30 [2021-12-18 22:09:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:05,938 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2021-12-18 22:09:05,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2021-12-18 22:09:05,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 22:09:05,939 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:05,939 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:05,946 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 22:09:06,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:06,146 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:06,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:06,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2021-12-18 22:09:06,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:06,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77044522] [2021-12-18 22:09:06,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:06,147 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:06,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:06,148 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:06,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-18 22:09:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:06,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 22:09:06,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:06,261 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 22:09:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:09:06,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:06,418 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:06,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77044522] [2021-12-18 22:09:06,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77044522] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:06,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:06,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 22:09:06,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307925726] [2021-12-18 22:09:06,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:06,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:09:06,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:06,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:09:06,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:09:06,419 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:06,887 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2021-12-18 22:09:06,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:09:06,887 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-18 22:09:06,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:06,888 INFO L225 Difference]: With dead ends: 136 [2021-12-18 22:09:06,888 INFO L226 Difference]: Without dead ends: 136 [2021-12-18 22:09:06,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-18 22:09:06,889 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 325 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:06,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 422 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 22:09:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-18 22:09:06,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 90. [2021-12-18 22:09:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.453125) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:09:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2021-12-18 22:09:06,896 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 30 [2021-12-18 22:09:06,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:06,896 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2021-12-18 22:09:06,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:06,896 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2021-12-18 22:09:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 22:09:06,897 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:06,897 INFO L514 BasicCegarLoop]: trace histogram [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 22:09:06,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:07,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:07,098 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:07,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:07,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333178, now seen corresponding path program 1 times [2021-12-18 22:09:07,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:07,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151306207] [2021-12-18 22:09:07,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:07,099 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:07,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:07,100 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:07,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-18 22:09:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:07,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 22:09:07,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:09:07,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:07,294 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:07,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151306207] [2021-12-18 22:09:07,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151306207] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:07,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:07,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 22:09:07,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267898710] [2021-12-18 22:09:07,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:07,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 22:09:07,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:07,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 22:09:07,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 22:09:07,295 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:07,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:07,335 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2021-12-18 22:09:07,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 22:09:07,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-18 22:09:07,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:07,336 INFO L225 Difference]: With dead ends: 119 [2021-12-18 22:09:07,336 INFO L226 Difference]: Without dead ends: 119 [2021-12-18 22:09:07,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 22:09:07,337 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 112 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:07,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 143 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:09:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-18 22:09:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2021-12-18 22:09:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:09:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2021-12-18 22:09:07,340 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 32 [2021-12-18 22:09:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:07,340 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2021-12-18 22:09:07,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2021-12-18 22:09:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-18 22:09:07,340 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:07,341 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-18 22:09:07,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:07,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:07,549 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2021-12-18 22:09:07,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:07,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047468841] [2021-12-18 22:09:07,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:07,549 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:07,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:07,550 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:07,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-18 22:09:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:07,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:09:07,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:09:07,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:07,706 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:07,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047468841] [2021-12-18 22:09:07,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047468841] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:07,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:07,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 22:09:07,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854548281] [2021-12-18 22:09:07,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:07,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 22:09:07,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:07,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 22:09:07,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 22:09:07,708 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:07,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:07,735 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2021-12-18 22:09:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 22:09:07,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2021-12-18 22:09:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:07,737 INFO L225 Difference]: With dead ends: 168 [2021-12-18 22:09:07,737 INFO L226 Difference]: Without dead ends: 168 [2021-12-18 22:09:07,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:09:07,737 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 98 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:07,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 221 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:09:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-18 22:09:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 93. [2021-12-18 22:09:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:09:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2021-12-18 22:09:07,740 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 33 [2021-12-18 22:09:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:07,741 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2021-12-18 22:09:07,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2021-12-18 22:09:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 22:09:07,742 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:07,742 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:07,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-18 22:09:07,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:07,942 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:07,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1813078092, now seen corresponding path program 2 times [2021-12-18 22:09:07,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:07,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500414277] [2021-12-18 22:09:07,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:09:07,943 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:07,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:07,944 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:07,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-18 22:09:08,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:09:08,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:09:08,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:09:08,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 22:09:08,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:09:08,188 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:08,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500414277] [2021-12-18 22:09:08,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500414277] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:09:08,188 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:08,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-18 22:09:08,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558412224] [2021-12-18 22:09:08,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:08,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 22:09:08,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:08,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 22:09:08,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:09:08,189 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-18 22:09:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:08,200 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2021-12-18 22:09:08,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 22:09:08,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2021-12-18 22:09:08,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:08,208 INFO L225 Difference]: With dead ends: 86 [2021-12-18 22:09:08,208 INFO L226 Difference]: Without dead ends: 86 [2021-12-18 22:09:08,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:09:08,208 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 186 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:08,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 158 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:09:08,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-18 22:09:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-12-18 22:09:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2021-12-18 22:09:08,210 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 37 [2021-12-18 22:09:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:08,211 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2021-12-18 22:09:08,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-18 22:09:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2021-12-18 22:09:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 22:09:08,211 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:08,211 INFO L514 BasicCegarLoop]: trace histogram [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 22:09:08,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:08,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:08,419 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:08,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash 274321506, now seen corresponding path program 1 times [2021-12-18 22:09:08,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:08,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112987046] [2021-12-18 22:09:08,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:08,420 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:08,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:08,421 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:08,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-18 22:09:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:08,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:09:08,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:09:08,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:09:08,684 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:08,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112987046] [2021-12-18 22:09:08,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112987046] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:09:08,684 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:08,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-18 22:09:08,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686093813] [2021-12-18 22:09:08,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:08,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 22:09:08,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:08,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 22:09:08,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:09:08,685 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:09:08,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:08,756 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2021-12-18 22:09:08,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:09:08,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2021-12-18 22:09:08,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:08,757 INFO L225 Difference]: With dead ends: 132 [2021-12-18 22:09:08,757 INFO L226 Difference]: Without dead ends: 132 [2021-12-18 22:09:08,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:09:08,758 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 170 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:08,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 268 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:09:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-18 22:09:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2021-12-18 22:09:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 94 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-12-18 22:09:08,760 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 37 [2021-12-18 22:09:08,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:08,760 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-12-18 22:09:08,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:09:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-12-18 22:09:08,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-18 22:09:08,761 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:08,761 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-18 22:09:08,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:08,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:08,961 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:08,962 INFO L85 PathProgramCache]: Analyzing trace with hash -46108703, now seen corresponding path program 1 times [2021-12-18 22:09:08,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:08,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384507455] [2021-12-18 22:09:08,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:08,963 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:08,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:08,964 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:08,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-18 22:09:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:09,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-18 22:09:09,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:09,119 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 22:09:09,222 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:09:09,222 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 22:09:09,280 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 22:09:09,362 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:09,362 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-18 22:09:09,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:09,504 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 33 treesize of output 28 [2021-12-18 22:09:09,561 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 27 treesize of output 15 [2021-12-18 22:09:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:09:09,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:09,881 INFO L354 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-18 22:09:09,881 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 23 treesize of output 22 [2021-12-18 22:09:09,886 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2021-12-18 22:09:09,894 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-18 22:09:09,900 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:09,900 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 18 treesize of output 19 [2021-12-18 22:09:09,902 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 30 treesize of output 22 [2021-12-18 22:09:09,905 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 9 treesize of output 7 [2021-12-18 22:09:10,073 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:10,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384507455] [2021-12-18 22:09:10,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384507455] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:10,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [228997955] [2021-12-18 22:09:10,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:10,074 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 22:09:10,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 22:09:10,088 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 22:09:10,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2021-12-18 22:09:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:10,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-18 22:09:10,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:10,291 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 22:09:10,513 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 22:09:10,515 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 20 treesize of output 27 [2021-12-18 22:09:10,658 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 22:09:10,849 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:10,849 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-18 22:09:11,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:11,124 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 35 treesize of output 30 [2021-12-18 22:09:11,284 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 29 treesize of output 17 [2021-12-18 22:09:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:09:11,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:13,775 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:13,776 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 22 treesize of output 23 [2021-12-18 22:09:13,779 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 38 treesize of output 30 [2021-12-18 22:09:13,784 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 13 treesize of output 11 [2021-12-18 22:09:22,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [228997955] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:22,867 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:22,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 32 [2021-12-18 22:09:22,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255878851] [2021-12-18 22:09:22,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:22,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-18 22:09:22,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:22,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-18 22:09:22,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1918, Unknown=6, NotChecked=178, Total=2256 [2021-12-18 22:09:22,869 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:09:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:24,588 INFO L93 Difference]: Finished difference Result 211 states and 236 transitions. [2021-12-18 22:09:24,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 22:09:24,588 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2021-12-18 22:09:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:24,589 INFO L225 Difference]: With dead ends: 211 [2021-12-18 22:09:24,589 INFO L226 Difference]: Without dead ends: 211 [2021-12-18 22:09:24,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=316, Invalid=2548, Unknown=6, NotChecked=210, Total=3080 [2021-12-18 22:09:24,591 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 512 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:24,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 1142 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 588 Invalid, 0 Unknown, 151 Unchecked, 0.9s Time] [2021-12-18 22:09:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-18 22:09:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 109. [2021-12-18 22:09:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 104 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2021-12-18 22:09:24,593 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 38 [2021-12-18 22:09:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:24,593 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2021-12-18 22:09:24,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:09:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2021-12-18 22:09:24,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-18 22:09:24,594 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:24,594 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-18 22:09:24,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:24,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:24,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:24,999 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:25,000 INFO L85 PathProgramCache]: Analyzing trace with hash -46108702, now seen corresponding path program 1 times [2021-12-18 22:09:25,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:25,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894827325] [2021-12-18 22:09:25,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:25,000 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:25,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:25,001 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:25,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-18 22:09:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:25,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-18 22:09:25,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:25,193 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 22:09:25,201 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 22:09:25,480 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 22:09:25,480 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 18 [2021-12-18 22:09:25,502 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:09:25,502 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 22:09:25,616 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 22:09:25,622 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 22:09:25,744 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:25,744 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 22:09:25,749 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 18 treesize of output 20 [2021-12-18 22:09:25,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:25,974 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 31 treesize of output 26 [2021-12-18 22:09:25,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:25,985 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 22:09:26,119 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 25 treesize of output 13 [2021-12-18 22:09:26,124 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 15 treesize of output 7 [2021-12-18 22:09:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:09:26,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:27,744 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_621 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-18 22:09:27,784 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_621 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-12-18 22:09:27,804 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:27,804 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 37 treesize of output 38 [2021-12-18 22:09:27,810 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:27,811 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 29 treesize of output 30 [2021-12-18 22:09:27,815 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 52 treesize of output 44 [2021-12-18 22:09:27,817 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 82 treesize of output 70 [2021-12-18 22:09:27,828 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 34 treesize of output 30 [2021-12-18 22:09:27,831 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 62 treesize of output 58 [2021-12-18 22:09:27,998 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:27,999 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 37 treesize of output 30 [2021-12-18 22:09:28,002 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 44 treesize of output 32 [2021-12-18 22:09:28,010 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 15 treesize of output 11 [2021-12-18 22:09:28,699 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:28,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894827325] [2021-12-18 22:09:28,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894827325] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:28,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [570325038] [2021-12-18 22:09:28,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:28,703 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 22:09:28,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 22:09:28,706 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 22:09:28,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2021-12-18 22:09:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:28,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-18 22:09:28,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:28,952 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 22:09:28,958 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 22:09:29,186 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 22:09:29,186 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 18 [2021-12-18 22:09:29,217 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:09:29,217 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 22:09:29,257 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 22:09:29,267 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 22:09:29,361 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:29,362 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 22:09:29,367 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 18 treesize of output 20 [2021-12-18 22:09:29,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:29,507 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 22:09:29,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:29,513 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 31 treesize of output 26 [2021-12-18 22:09:29,614 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 25 treesize of output 13 [2021-12-18 22:09:29,618 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 15 treesize of output 7 [2021-12-18 22:09:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:09:29,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:30,624 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2021-12-18 22:09:30,665 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-12-18 22:09:30,681 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:30,681 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 37 treesize of output 30 [2021-12-18 22:09:30,684 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 44 treesize of output 32 [2021-12-18 22:09:30,690 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 15 treesize of output 11 [2021-12-18 22:09:30,712 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:30,712 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 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-18 22:09:30,726 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:30,727 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 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-18 22:09:30,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:09:30,734 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 27 treesize of output 19 [2021-12-18 22:09:30,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:09:30,740 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 20 treesize of output 12 [2021-12-18 22:09:31,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [570325038] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:31,201 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:31,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2021-12-18 22:09:31,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213358306] [2021-12-18 22:09:31,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:31,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-18 22:09:31,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:31,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-18 22:09:31,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=855, Unknown=4, NotChecked=244, Total=1190 [2021-12-18 22:09:31,202 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:33,348 INFO L93 Difference]: Finished difference Result 237 states and 275 transitions. [2021-12-18 22:09:33,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 22:09:33,349 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2021-12-18 22:09:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:33,350 INFO L225 Difference]: With dead ends: 237 [2021-12-18 22:09:33,350 INFO L226 Difference]: Without dead ends: 237 [2021-12-18 22:09:33,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 70 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=181, Invalid=1391, Unknown=4, NotChecked=316, Total=1892 [2021-12-18 22:09:33,352 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 621 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:33,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [621 Valid, 1190 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 654 Invalid, 0 Unknown, 120 Unchecked, 1.2s Time] [2021-12-18 22:09:33,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-12-18 22:09:33,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 117. [2021-12-18 22:09:33,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 112 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2021-12-18 22:09:33,359 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 38 [2021-12-18 22:09:33,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:33,359 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2021-12-18 22:09:33,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:33,360 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2021-12-18 22:09:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-18 22:09:33,362 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:33,362 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-18 22:09:33,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:33,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:33,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:33,770 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:33,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash 766820837, now seen corresponding path program 2 times [2021-12-18 22:09:33,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:33,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331953794] [2021-12-18 22:09:33,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:09:33,771 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:33,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:33,772 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:33,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-18 22:09:33,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:09:33,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:09:33,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 22:09:33,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:09:34,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:09:34,150 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:34,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331953794] [2021-12-18 22:09:34,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331953794] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:09:34,150 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:34,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-18 22:09:34,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019174718] [2021-12-18 22:09:34,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:34,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:09:34,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:34,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:09:34,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:09:34,151 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:09:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:34,264 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2021-12-18 22:09:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 22:09:34,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-18 22:09:34,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:34,266 INFO L225 Difference]: With dead ends: 159 [2021-12-18 22:09:34,266 INFO L226 Difference]: Without dead ends: 159 [2021-12-18 22:09:34,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-18 22:09:34,266 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 152 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:34,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 382 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:09:34,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-18 22:09:34,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 103. [2021-12-18 22:09:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 98 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2021-12-18 22:09:34,268 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 41 [2021-12-18 22:09:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:34,268 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2021-12-18 22:09:34,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:09:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2021-12-18 22:09:34,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-18 22:09:34,269 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:34,269 INFO L514 BasicCegarLoop]: trace histogram [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 22:09:34,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:34,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:34,470 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:34,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash -168412858, now seen corresponding path program 2 times [2021-12-18 22:09:34,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:34,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038019499] [2021-12-18 22:09:34,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:09:34,470 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:34,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:34,472 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:34,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-18 22:09:34,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 22:09:34,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:09:34,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:09:34,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-18 22:09:34,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:34,632 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:34,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038019499] [2021-12-18 22:09:34,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038019499] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:34,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:34,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 22:09:34,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069439121] [2021-12-18 22:09:34,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:34,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 22:09:34,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:34,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 22:09:34,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 22:09:34,634 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:34,665 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2021-12-18 22:09:34,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 22:09:34,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2021-12-18 22:09:34,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:34,666 INFO L225 Difference]: With dead ends: 105 [2021-12-18 22:09:34,666 INFO L226 Difference]: Without dead ends: 105 [2021-12-18 22:09:34,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:09:34,674 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 23 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:34,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 209 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:09:34,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-18 22:09:34,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2021-12-18 22:09:34,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.3375) internal successors, (107), 96 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:34,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-12-18 22:09:34,677 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 42 [2021-12-18 22:09:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:34,677 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-12-18 22:09:34,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-12-18 22:09:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-18 22:09:34,678 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:34,678 INFO L514 BasicCegarLoop]: trace histogram [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 22:09:34,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-12-18 22:09:34,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:34,883 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:34,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:34,884 INFO L85 PathProgramCache]: Analyzing trace with hash -168412913, now seen corresponding path program 1 times [2021-12-18 22:09:34,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:34,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192471706] [2021-12-18 22:09:34,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:34,884 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:34,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:34,885 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:34,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-18 22:09:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:35,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:09:35,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:09:35,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:09:35,201 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:35,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192471706] [2021-12-18 22:09:35,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192471706] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:09:35,202 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:35,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-18 22:09:35,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186233829] [2021-12-18 22:09:35,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:35,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 22:09:35,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:35,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 22:09:35,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:09:35,203 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:35,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:35,307 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2021-12-18 22:09:35,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 22:09:35,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2021-12-18 22:09:35,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:35,308 INFO L225 Difference]: With dead ends: 146 [2021-12-18 22:09:35,308 INFO L226 Difference]: Without dead ends: 146 [2021-12-18 22:09:35,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:09:35,309 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 166 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:35,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 377 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:09:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-18 22:09:35,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 97. [2021-12-18 22:09:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 92 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2021-12-18 22:09:35,312 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 42 [2021-12-18 22:09:35,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:35,312 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2021-12-18 22:09:35,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2021-12-18 22:09:35,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-18 22:09:35,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:35,313 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2021-12-18 22:09:35,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-18 22:09:35,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:35,516 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:35,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:35,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1344923923, now seen corresponding path program 1 times [2021-12-18 22:09:35,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:35,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439501787] [2021-12-18 22:09:35,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:35,517 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:35,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:35,518 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:35,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-18 22:09:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:35,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 22:09:35,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:35,672 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 22:09:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 22:09:35,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:35,822 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:35,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439501787] [2021-12-18 22:09:35,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439501787] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:35,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:35,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 22:09:35,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387971291] [2021-12-18 22:09:35,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:35,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:09:35,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:35,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:09:35,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:09:35,823 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:36,315 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2021-12-18 22:09:36,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:09:36,315 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-18 22:09:36,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:36,316 INFO L225 Difference]: With dead ends: 122 [2021-12-18 22:09:36,316 INFO L226 Difference]: Without dead ends: 122 [2021-12-18 22:09:36,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-18 22:09:36,317 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 273 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:36,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 264 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 22:09:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-18 22:09:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 100. [2021-12-18 22:09:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 95 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2021-12-18 22:09:36,324 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 45 [2021-12-18 22:09:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:36,325 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2021-12-18 22:09:36,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2021-12-18 22:09:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-18 22:09:36,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:36,325 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2021-12-18 22:09:36,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-18 22:09:36,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:36,533 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:36,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:36,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1344923924, now seen corresponding path program 1 times [2021-12-18 22:09:36,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:36,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779243912] [2021-12-18 22:09:36,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:36,538 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:36,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:36,539 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:36,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-18 22:09:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:36,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 22:09:36,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:36,708 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 22:09:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 22:09:36,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:36,948 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:36,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779243912] [2021-12-18 22:09:36,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779243912] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:36,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:36,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 22:09:36,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608721922] [2021-12-18 22:09:36,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:36,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:09:36,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:09:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:09:36,949 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:37,346 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2021-12-18 22:09:37,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:09:37,347 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-18 22:09:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:37,347 INFO L225 Difference]: With dead ends: 134 [2021-12-18 22:09:37,347 INFO L226 Difference]: Without dead ends: 134 [2021-12-18 22:09:37,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-18 22:09:37,348 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 413 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:37,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 264 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 22:09:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-18 22:09:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 100. [2021-12-18 22:09:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 95 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2021-12-18 22:09:37,350 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 45 [2021-12-18 22:09:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:37,350 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2021-12-18 22:09:37,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2021-12-18 22:09:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-18 22:09:37,350 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:37,350 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-12-18 22:09:37,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-12-18 22:09:37,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:37,559 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:37,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1217170439, now seen corresponding path program 3 times [2021-12-18 22:09:37,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:37,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000135707] [2021-12-18 22:09:37,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 22:09:37,561 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:37,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:37,562 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:37,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-18 22:09:37,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-18 22:09:37,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:09:37,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 22:09:37,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:09:37,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:38,263 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:38,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000135707] [2021-12-18 22:09:38,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000135707] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:38,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1465372702] [2021-12-18 22:09:38,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 22:09:38,264 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 22:09:38,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 22:09:38,265 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 22:09:38,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2021-12-18 22:09:38,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-18 22:09:38,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:09:38,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 22:09:38,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:09:38,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:38,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1465372702] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:38,796 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:38,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-12-18 22:09:38,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295712104] [2021-12-18 22:09:38,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:38,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 22:09:38,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:38,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 22:09:38,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-12-18 22:09:38,797 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:38,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:38,901 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2021-12-18 22:09:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 22:09:38,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2021-12-18 22:09:38,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:38,903 INFO L225 Difference]: With dead ends: 95 [2021-12-18 22:09:38,903 INFO L226 Difference]: Without dead ends: 94 [2021-12-18 22:09:38,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-12-18 22:09:38,903 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 107 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:38,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 260 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:09:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-18 22:09:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-18 22:09:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2021-12-18 22:09:38,906 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 46 [2021-12-18 22:09:38,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:38,906 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2021-12-18 22:09:38,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:38,906 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2021-12-18 22:09:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-18 22:09:38,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:38,907 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:38,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-12-18 22:09:39,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:39,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-18 22:09:39,310 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:39,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash -399124699, now seen corresponding path program 1 times [2021-12-18 22:09:39,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:39,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837206254] [2021-12-18 22:09:39,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:39,312 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:39,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:39,313 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:39,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-18 22:09:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:39,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-18 22:09:39,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:39,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 22:09:39,646 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:09:39,647 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 22:09:39,700 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 22:09:39,780 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:39,780 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-18 22:09:39,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:39,954 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 22 treesize of output 21 [2021-12-18 22:09:39,960 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 22:09:40,106 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 16 treesize of output 8 [2021-12-18 22:09:40,228 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 22:09:40,427 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 22:09:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:09:40,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:40,860 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~len~0#1|)) is different from false [2021-12-18 22:09:40,874 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~len~0#1|)) is different from false [2021-12-18 22:09:40,886 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~len~0#1|)) is different from false [2021-12-18 22:09:40,920 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~len~0#1|)) is different from false [2021-12-18 22:09:40,936 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:40,936 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 36 treesize of output 37 [2021-12-18 22:09:40,952 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:40,952 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 67 [2021-12-18 22:09:40,959 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 25 treesize of output 21 [2021-12-18 22:09:41,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (_ BitVec 32)) (v_ArrVal_1106 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1106) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)) v_ArrVal_1109) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-18 22:09:41,338 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (_ BitVec 32)) (v_ArrVal_1106 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1106) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv4 32)) v_ArrVal_1109) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-18 22:09:41,346 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:41,346 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 24 treesize of output 25 [2021-12-18 22:09:41,351 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 43 treesize of output 39 [2021-12-18 22:09:41,359 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 52 treesize of output 48 [2021-12-18 22:09:41,379 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 24 treesize of output 22 [2021-12-18 22:09:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-18 22:09:42,081 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:42,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837206254] [2021-12-18 22:09:42,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837206254] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:09:42,081 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:42,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 46 [2021-12-18 22:09:42,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117762177] [2021-12-18 22:09:42,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:42,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-18 22:09:42,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:42,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-18 22:09:42,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1463, Unknown=6, NotChecked=486, Total=2070 [2021-12-18 22:09:42,083 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 46 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 41 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:09:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:44,964 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-12-18 22:09:44,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-18 22:09:44,965 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 41 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2021-12-18 22:09:44,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:44,965 INFO L225 Difference]: With dead ends: 94 [2021-12-18 22:09:44,965 INFO L226 Difference]: Without dead ends: 94 [2021-12-18 22:09:44,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=275, Invalid=2823, Unknown=6, NotChecked=678, Total=3782 [2021-12-18 22:09:44,966 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 198 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 738 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:44,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 1457 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 841 Invalid, 0 Unknown, 738 Unchecked, 1.4s Time] [2021-12-18 22:09:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-18 22:09:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-18 22:09:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2021-12-18 22:09:44,968 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 49 [2021-12-18 22:09:44,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:44,968 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-12-18 22:09:44,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 41 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:09:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2021-12-18 22:09:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-18 22:09:44,969 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:44,969 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:44,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:45,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:45,176 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:45,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:45,177 INFO L85 PathProgramCache]: Analyzing trace with hash 780049028, now seen corresponding path program 1 times [2021-12-18 22:09:45,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:45,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373276435] [2021-12-18 22:09:45,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:45,177 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:45,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:45,178 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:45,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-18 22:09:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:45,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:09:45,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 22:09:45,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 22:09:45,558 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:45,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373276435] [2021-12-18 22:09:45,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373276435] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:09:45,558 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:45,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-18 22:09:45,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583036217] [2021-12-18 22:09:45,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:45,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:09:45,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:45,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:09:45,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:09:45,559 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:45,670 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2021-12-18 22:09:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 22:09:45,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2021-12-18 22:09:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:45,672 INFO L225 Difference]: With dead ends: 134 [2021-12-18 22:09:45,672 INFO L226 Difference]: Without dead ends: 134 [2021-12-18 22:09:45,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-12-18 22:09:45,672 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 115 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:45,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 514 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:09:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-18 22:09:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 98. [2021-12-18 22:09:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 93 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2021-12-18 22:09:45,674 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 55 [2021-12-18 22:09:45,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:45,674 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2021-12-18 22:09:45,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2021-12-18 22:09:45,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-18 22:09:45,675 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:45,675 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:45,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:45,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:45,885 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:45,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash 780048973, now seen corresponding path program 1 times [2021-12-18 22:09:45,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:45,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567842979] [2021-12-18 22:09:45,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:45,886 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:45,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:45,888 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:09:45,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-18 22:09:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:46,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 79 conjunts are in the unsatisfiable core [2021-12-18 22:09:46,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:46,208 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 22:09:46,413 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:09:46,413 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 22:09:46,506 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 22:09:46,512 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 22:09:46,636 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:46,637 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-18 22:09:46,642 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 18 treesize of output 20 [2021-12-18 22:09:46,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:46,978 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 22:09:46,988 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 15 treesize of output 11 [2021-12-18 22:09:46,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2021-12-18 22:09:47,332 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 15 treesize of output 7 [2021-12-18 22:09:47,517 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 9 treesize of output 3 [2021-12-18 22:09:47,533 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:47,533 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-18 22:09:47,746 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 27 treesize of output 15 [2021-12-18 22:09:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:09:47,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:48,144 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1232) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:48,158 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1232) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:48,720 INFO L354 Elim1Store]: treesize reduction 5, result has 88.4 percent of original size [2021-12-18 22:09:48,720 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 51 treesize of output 50 [2021-12-18 22:09:48,728 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1222))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)) v_ArrVal_1227))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1232))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2021-12-18 22:09:48,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1222))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv4 32)) v_ArrVal_1227))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1232))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-18 22:09:48,753 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:48,753 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 62 treesize of output 47 [2021-12-18 22:09:48,756 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 102 treesize of output 94 [2021-12-18 22:09:48,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:09:48,762 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 28 treesize of output 22 [2021-12-18 22:09:48,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:09:48,768 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 36 treesize of output 28 [2021-12-18 22:09:48,771 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 46 treesize of output 42 [2021-12-18 22:09:49,076 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:49,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567842979] [2021-12-18 22:09:49,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567842979] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:49,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1059630942] [2021-12-18 22:09:49,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:49,077 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 22:09:49,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 22:09:49,078 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 22:09:49,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2021-12-18 22:09:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:49,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-18 22:09:49,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:49,437 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 22:09:49,871 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 22:09:49,871 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 20 treesize of output 27 [2021-12-18 22:09:50,075 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 22:09:50,274 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 22:09:50,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:50,772 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 22:09:50,775 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 22:09:50,855 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 15 treesize of output 7 [2021-12-18 22:09:51,147 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-12-18 22:09:51,620 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 19 treesize of output 11 [2021-12-18 22:09:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:09:51,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:52,677 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 314 treesize of output 290 [2021-12-18 22:10:00,237 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:00,237 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 26 treesize of output 27 [2021-12-18 22:10:00,241 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 47 treesize of output 43 [2021-12-18 22:10:00,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:00,246 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 31 treesize of output 29 [2021-12-18 22:10:00,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 51 treesize of output 47 [2021-12-18 22:10:01,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1059630942] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:10:01,231 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:10:01,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 44 [2021-12-18 22:10:01,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677331366] [2021-12-18 22:10:01,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:10:01,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-18 22:10:01,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:10:01,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-18 22:10:01,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=4418, Unknown=27, NotChecked=548, Total=5256 [2021-12-18 22:10:01,235 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 45 states, 43 states have (on average 2.186046511627907) internal successors, (94), 40 states have internal predecessors, (94), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-18 22:10:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:10:09,193 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2021-12-18 22:10:09,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-18 22:10:09,194 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 2.186046511627907) internal successors, (94), 40 states have internal predecessors, (94), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 55 [2021-12-18 22:10:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:10:09,195 INFO L225 Difference]: With dead ends: 157 [2021-12-18 22:10:09,195 INFO L226 Difference]: Without dead ends: 157 [2021-12-18 22:10:09,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1917 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=940, Invalid=7239, Unknown=27, NotChecked=724, Total=8930 [2021-12-18 22:10:09,197 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 865 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-18 22:10:09,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [865 Valid, 1524 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1021 Invalid, 0 Unknown, 320 Unchecked, 1.7s Time] [2021-12-18 22:10:09,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-18 22:10:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 102. [2021-12-18 22:10:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 97 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:10:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2021-12-18 22:10:09,199 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 55 [2021-12-18 22:10:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:10:09,199 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2021-12-18 22:10:09,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 2.186046511627907) internal successors, (94), 40 states have internal predecessors, (94), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-18 22:10:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2021-12-18 22:10:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-18 22:10:09,199 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:10:09,200 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:10:09,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2021-12-18 22:10:09,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-12-18 22:10:09,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:10:09,602 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:10:09,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:10:09,602 INFO L85 PathProgramCache]: Analyzing trace with hash 780048974, now seen corresponding path program 1 times [2021-12-18 22:10:09,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:10:09,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628458475] [2021-12-18 22:10:09,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:10:09,603 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:10:09,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:10:09,604 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:10:09,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-18 22:10:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:10:09,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-18 22:10:09,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:10:09,975 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 22:10:09,985 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 22:10:10,324 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:10:10,325 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 22:10:10,343 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 22:10:10,463 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 22:10:10,470 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 22:10:10,641 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:10: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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 22:10:10,646 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 18 treesize of output 20 [2021-12-18 22:10:10,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:10:10,920 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 22:10:10,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:10:10,929 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 31 treesize of output 26 [2021-12-18 22:10:10,938 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 15 treesize of output 11 [2021-12-18 22:10:11,419 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:10:11,420 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 22:10:11,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:10:11,424 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 18 treesize of output 20 [2021-12-18 22:10:11,444 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 9 treesize of output 3 [2021-12-18 22:10:11,696 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 22:10:11,699 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 25 treesize of output 13 [2021-12-18 22:10:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:10:11,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:10:12,395 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1364) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1364) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2021-12-18 22:10:12,428 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1364) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1364) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-18 22:10:12,453 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1364) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1364) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1367) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2021-12-18 22:10:12,485 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1364) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1364) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1367) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2021-12-18 22:10:12,544 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (_ BitVec 32))) (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1362)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1361)) .cse1 v_ArrVal_1364) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1367) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1362 (_ BitVec 32))) (let ((.cse3 (select (select (let ((.cse4 (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_1361)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_1362)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1364)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-18 22:10:12,661 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (_ BitVec 32))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1362))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1361)) .cse1 v_ArrVal_1364) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse1 v_ArrVal_1367) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1362 (_ BitVec 32))) (let ((.cse3 (select (select (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_1361)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_1362) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1364)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-18 22:10:12,699 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1362 (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv4 32)))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse1 v_ArrVal_1361)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse1 v_ArrVal_1362) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1364)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (_ BitVec 32))) (let ((.cse2 (bvadd |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv4 32)))) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse2 v_ArrVal_1362))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse2 v_ArrVal_1361)) .cse3 v_ArrVal_1364) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse4) .cse3 v_ArrVal_1367) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))))) is different from false [2021-12-18 22:10:12,727 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1362 (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1361)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1362) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1364)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (_ BitVec 32))) (let ((.cse2 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1362))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1361)) .cse3 v_ArrVal_1364) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse4) .cse3 v_ArrVal_1367) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))) is different from false [2021-12-18 22:10:13,141 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1356)) (.cse1 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1362))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1357))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1361))) .cse2 v_ArrVal_1364) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store (store .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse4) .cse2 v_ArrVal_1367) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (_ BitVec 32))) (let ((.cse5 (select (select (let ((.cse7 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1357))) (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse7 v_ArrVal_1361))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1356) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse7 v_ArrVal_1362) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1364)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse5 (_ bv4 32)) (bvadd .cse5 (_ bv8 32)))))) is different from false [2021-12-18 22:10:13,485 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1356)) (.cse1 (bvadd |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv4 32)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1362))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1357))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1361))) .cse2 v_ArrVal_1364) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store (store .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse4) .cse2 v_ArrVal_1367) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (_ BitVec 32))) (let ((.cse5 (select (select (let ((.cse7 (bvadd |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv4 32)))) (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1357))) (store .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse7 v_ArrVal_1361))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1356) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse7 v_ArrVal_1362) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1364)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd .cse5 (_ bv4 32)) (bvadd .cse5 (_ bv8 32)))))) is different from false [2021-12-18 22:10:13,505 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:13,505 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 118 [2021-12-18 22:10:13,532 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:13,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 109 treesize of output 86 [2021-12-18 22:10:13,538 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 274 treesize of output 270 [2021-12-18 22:10:13,544 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 666 treesize of output 632 [2021-12-18 22:10:13,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:13,556 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 300 treesize of output 290 [2021-12-18 22:10:13,573 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:13,579 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 292 treesize of output 284 [2021-12-18 22:10:13,594 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:13,596 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 490 treesize of output 458 [2021-12-18 22:10:13,601 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 458 treesize of output 442 [2021-12-18 22:10:13,605 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 662 treesize of output 628 [2021-12-18 22:10:13,613 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 624 treesize of output 604 [2021-12-18 22:10:14,487 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:14,488 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 102 [2021-12-18 22:10:14,497 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:14,497 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 93 treesize of output 86 [2021-12-18 22:10:14,503 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 154 treesize of output 148 [2021-12-18 22:10:14,508 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 218 treesize of output 208 [2021-12-18 22:10:14,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:14,514 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 182 treesize of output 174 [2021-12-18 22:10:14,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:14,520 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 160 treesize of output 150 [2021-12-18 22:10:14,528 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:14,535 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 62 treesize of output 58 [2021-12-18 22:10:14,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:14,546 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 70 treesize of output 64 [2021-12-18 22:10:14,551 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 118 treesize of output 110 [2021-12-18 22:10:15,609 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:10:15,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628458475] [2021-12-18 22:10:15,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628458475] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:10:15,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1857274202] [2021-12-18 22:10:15,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:10:15,610 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 22:10:15,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 22:10:15,611 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 22:10:15,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2021-12-18 22:10:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:10:15,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-18 22:10:15,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:10:16,009 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 22:10:16,016 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 22:10:16,386 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 22:10:16,386 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 18 [2021-12-18 22:10:16,406 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:10:16,406 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 22:10:16,669 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 22:10:16,677 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 22:10:16,917 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:10:16,917 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 22:10:16,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 22:10:17,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:10:17,250 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 31 treesize of output 26 [2021-12-18 22:10:17,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:10:17,259 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 22:10:17,540 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:10:17,541 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 22:10:17,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:10:17,545 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 18 treesize of output 20 [2021-12-18 22:10:17,715 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 22:10:17,717 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 25 treesize of output 13 [2021-12-18 22:10:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 22:10:17,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:10:17,928 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1437) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1438 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1437) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1438) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-18 22:10:17,971 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1438 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1437) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1438) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1437) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2021-12-18 22:10:18,001 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1437) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1438 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1437) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1438) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2021-12-18 22:10:18,052 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1438 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1437) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1438) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1437) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32)))))) is different from false [2021-12-18 22:10:18,126 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1433 (_ BitVec 32)) (v_ArrVal_1434 (_ BitVec 32)) (v_ArrVal_1438 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1434)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1433)) .cse1 v_ArrVal_1437) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1438) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((v_ArrVal_1433 (_ BitVec 32)) (v_ArrVal_1434 (_ BitVec 32)) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (let ((.cse4 (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_1433)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_1434)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1437)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-18 22:10:18,191 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1433 (_ BitVec 32)) (v_ArrVal_1434 (_ BitVec 32)) (v_ArrVal_1438 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1434))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1433)) .cse1 v_ArrVal_1437) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse1 v_ArrVal_1438) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((v_ArrVal_1433 (_ BitVec 32)) (v_ArrVal_1434 (_ BitVec 32)) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_1433)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_1434) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1437)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-18 22:10:18,219 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1433 (_ BitVec 32)) (v_ArrVal_1434 (_ BitVec 32)) (v_ArrVal_1438 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv4 32)))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse0 v_ArrVal_1434))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse0 v_ArrVal_1433)) .cse1 v_ArrVal_1437) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse2) .cse1 v_ArrVal_1438) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))))) (forall ((v_ArrVal_1433 (_ BitVec 32)) (v_ArrVal_1434 (_ BitVec 32)) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (let ((.cse4 (bvadd |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv4 32)))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse4 v_ArrVal_1433)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse4 v_ArrVal_1434) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1437)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-18 22:10:18,253 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1433 (_ BitVec 32)) (v_ArrVal_1434 (_ BitVec 32)) (v_ArrVal_1438 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_1434))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_1433)) .cse1 v_ArrVal_1437) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2) .cse1 v_ArrVal_1438) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (forall ((v_ArrVal_1433 (_ BitVec 32)) (v_ArrVal_1434 (_ BitVec 32)) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (let ((.cse4 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1433)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1434) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1437)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-18 22:10:18,637 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1433 (_ BitVec 32)) (v_ArrVal_1434 (_ BitVec 32)) (v_ArrVal_1431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1438 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1432)) (.cse1 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1434))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1431))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1433))) .cse2 v_ArrVal_1437) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store (store .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse4) .cse2 v_ArrVal_1438) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (forall ((v_ArrVal_1433 (_ BitVec 32)) (v_ArrVal_1434 (_ BitVec 32)) (v_ArrVal_1431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1431))) (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse7 v_ArrVal_1433))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1432) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse7 v_ArrVal_1434) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1437)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse5 (_ bv4 32)) (bvadd .cse5 (_ bv8 32)))))) is different from false [2021-12-18 22:10:19,339 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1433 (_ BitVec 32)) (v_ArrVal_1434 (_ BitVec 32)) (v_ArrVal_1431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1438 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1432)) (.cse1 (bvadd |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv4 32)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1434))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1431))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1433))) .cse2 v_ArrVal_1437) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store (store .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse4) .cse2 v_ArrVal_1438) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) (forall ((v_ArrVal_1433 (_ BitVec 32)) (v_ArrVal_1434 (_ BitVec 32)) (v_ArrVal_1431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (bvadd |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv4 32)))) (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1431))) (store .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse7 v_ArrVal_1433))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1432) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse7 v_ArrVal_1434) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1437)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd .cse5 (_ bv4 32)) (bvadd .cse5 (_ bv8 32)))))) is different from false [2021-12-18 22:10:19,358 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:19,358 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 118 [2021-12-18 22:10:19,368 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:19,369 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 109 treesize of output 86 [2021-12-18 22:10:19,374 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 274 treesize of output 270 [2021-12-18 22:10:19,379 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 666 treesize of output 632 [2021-12-18 22:10:19,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:19,393 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 300 treesize of output 290 [2021-12-18 22:10:19,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:19,408 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 292 treesize of output 284 [2021-12-18 22:10:19,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:19,414 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 490 treesize of output 458 [2021-12-18 22:10:19,419 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 678 treesize of output 644 [2021-12-18 22:10:19,426 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 624 [2021-12-18 22:10:19,431 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 624 treesize of output 604 [2021-12-18 22:10:20,219 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:20,219 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 102 [2021-12-18 22:10:20,226 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:20,226 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 93 treesize of output 86 [2021-12-18 22:10:20,230 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 154 treesize of output 148 [2021-12-18 22:10:20,232 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 218 treesize of output 208 [2021-12-18 22:10:20,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:20,235 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 182 treesize of output 174 [2021-12-18 22:10:20,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:20,239 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 160 treesize of output 150 [2021-12-18 22:10:20,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:20,255 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 62 treesize of output 58 [2021-12-18 22:10:20,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:20,267 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 70 treesize of output 64 [2021-12-18 22:10:20,270 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 118 treesize of output 110 [2021-12-18 22:10:21,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1857274202] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:10:21,020 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:10:21,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21] total 37 [2021-12-18 22:10:21,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053721805] [2021-12-18 22:10:21,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:10:21,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-18 22:10:21,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:10:21,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-18 22:10:21,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1854, Unknown=20, NotChecked=2100, Total=4160 [2021-12-18 22:10:21,022 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 38 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 33 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-18 22:10:27,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:10:27,538 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2021-12-18 22:10:27,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-18 22:10:27,539 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 33 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 55 [2021-12-18 22:10:27,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:10:27,540 INFO L225 Difference]: With dead ends: 176 [2021-12-18 22:10:27,540 INFO L226 Difference]: Without dead ends: 176 [2021-12-18 22:10:27,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=555, Invalid=3795, Unknown=20, NotChecked=2940, Total=7310 [2021-12-18 22:10:27,541 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 843 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-18 22:10:27,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [843 Valid, 1278 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 941 Invalid, 0 Unknown, 141 Unchecked, 1.9s Time] [2021-12-18 22:10:27,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-18 22:10:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 101. [2021-12-18 22:10:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 96 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:10:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2021-12-18 22:10:27,543 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 55 [2021-12-18 22:10:27,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:10:27,543 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2021-12-18 22:10:27,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 33 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-18 22:10:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2021-12-18 22:10:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-18 22:10:27,544 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:10:27,544 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:10:27,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2021-12-18 22:10:27,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2021-12-18 22:10:27,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-18 22:10:27,945 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:10:27,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:10:27,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1039883103, now seen corresponding path program 1 times [2021-12-18 22:10:27,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:10:27,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251347737] [2021-12-18 22:10:27,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:10:27,946 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:10:27,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:10:27,947 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:10:27,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-18 22:10:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:10:28,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 86 conjunts are in the unsatisfiable core [2021-12-18 22:10:28,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:10:28,268 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 22:10:28,405 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:10:28,405 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 22:10:28,478 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 22:10:28,485 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 22:10:28,594 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:10:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-18 22:10:28,601 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 18 treesize of output 20 [2021-12-18 22:10:28,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:10:28,851 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 22 treesize of output 21 [2021-12-18 22:10:28,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:10:28,859 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 22:10:28,880 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 15 treesize of output 11 [2021-12-18 22:10:29,471 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:10:29,471 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2021-12-18 22:10:29,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:10:29,477 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 37 treesize of output 32 [2021-12-18 22:10:29,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:10:29,484 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 37 treesize of output 37 [2021-12-18 22:10:30,060 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 25 treesize of output 17 [2021-12-18 22:10:30,062 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 28 treesize of output 16 [2021-12-18 22:10:30,193 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:10:30,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 24 treesize of output 16 [2021-12-18 22:10:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:10:30,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:10:30,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)) |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1509) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32))))) is different from false [2021-12-18 22:10:30,919 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset| (_ bv4 32)) |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1509) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32))))) is different from false [2021-12-18 22:10:30,945 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (_ bv4 32)) |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1509) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)))))) is different from false [2021-12-18 22:10:30,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (bvadd |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~len~0#1|))) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1509) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)))))) is different from false [2021-12-18 22:10:31,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (bvadd |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1509) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)))))) is different from false [2021-12-18 22:10:31,025 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 1406 treesize of output 1270 [2021-12-18 22:10:34,529 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1506 (_ BitVec 32))) (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse3 v_ArrVal_1505)))) (let ((.cse0 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse3 v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1509) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (and (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)) |c_ULTIMATE.start_sll_circular_update_at_~data#1|) (= .cse0 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)) v_ArrVal_1506)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)))))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1506 (_ BitVec 32))) (let ((.cse14 (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse14 v_ArrVal_1506)))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse14 v_ArrVal_1505))) (.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse7 (select (select (store .cse13 .cse11 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse8 (select (select (store .cse12 .cse11 v_ArrVal_1509) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse9 (= .cse8 (select (select .cse12 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (.cse6 (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|)) (.cse10 (= .cse7 .cse11))) (or (and (let ((.cse4 (= .cse8 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse5 (= .cse7 |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|))) (or (and (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)) |c_ULTIMATE.start_sll_circular_update_at_~data#1|) .cse4 .cse5) (and .cse4 .cse6 .cse5))) (or (not .cse9) (not .cse10))) (and .cse9 .cse6 .cse10)))))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (_ BitVec 32))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)) v_ArrVal_1506)))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse16 (select (select (store .cse18 .cse17 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)) |c_ULTIMATE.start_sll_circular_update_at_~data#1|) (forall ((v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (= (select (select (let ((.cse15 (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse15 v_ArrVal_1505)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse15 v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1509)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (= .cse16 |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (= .cse16 .cse17))))))) is different from false [2021-12-18 22:10:35,895 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1506 (_ BitVec 32))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse1 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_1505))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1509) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|)) (and (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1506))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (= .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1506 (_ BitVec 32))) (let ((.cse13 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse11 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse13 v_ArrVal_1506))) (let ((.cse12 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse13 v_ArrVal_1505)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| .cse12) .cse10 v_ArrVal_1509) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse9 (= .cse7 (select .cse12 |c_ULTIMATE.start_main_~s~0#1.offset|))) (.cse6 (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|)) (.cse8 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse11) .cse10 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (let ((.cse4 (= .cse8 |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (= .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and .cse4 .cse5 .cse6) (and .cse4 .cse5 (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|)))) (not .cse9)) (and .cse9 .cse6 (= .cse8 .cse10))))))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (_ BitVec 32))) (let ((.cse14 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1506))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse14) .cse15 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse15))))) is different from false [2021-12-18 22:10:36,005 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1506 (_ BitVec 32))) (let ((.cse5 (bvadd |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv4 32)))) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse5 v_ArrVal_1506))) (let ((.cse3 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse5 v_ArrVal_1505)) (.cse1 (select .cse4 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse3) .cse1 v_ArrVal_1509) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse4) .cse1 v_ArrVal_1508) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (or (and (= .cse0 .cse1) (= .cse2 (select .cse3 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)))))))) (forall ((v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1506 (_ BitVec 32))) (let ((.cse7 (bvadd |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv4 32)))) (let ((.cse6 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse7 v_ArrVal_1505))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse6) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse7 v_ArrVal_1506) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1509) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (select .cse6 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (_ BitVec 32))) (let ((.cse8 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv4 32)) v_ArrVal_1506))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse8) .cse9 v_ArrVal_1508) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse9))))) is different from false [2021-12-18 22:10:36,108 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1506 (_ BitVec 32))) (let ((.cse5 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5 v_ArrVal_1506))) (let ((.cse3 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5 v_ArrVal_1505)) (.cse1 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse3) .cse1 v_ArrVal_1509) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse4) .cse1 v_ArrVal_1508) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (= .cse0 .cse1) (= .cse2 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (_ BitVec 32))) (let ((.cse6 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)) v_ArrVal_1506))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse6) .cse7 v_ArrVal_1508) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse7)))) (forall ((v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1506 (_ BitVec 32))) (let ((.cse9 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse8 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse9 v_ArrVal_1505))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse8) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse9 v_ArrVal_1506) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1509) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2021-12-18 22:10:36,223 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (_ BitVec 32))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1500))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)) v_ArrVal_1506))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) .cse2 v_ArrVal_1508) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse2))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (_ BitVec 32)) (v_ArrVal_1499 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1500)) (.cse10 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse10 v_ArrVal_1506)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1499))) (let ((.cse6 (store (select .cse9 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse10 v_ArrVal_1505)) (.cse4 (select .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse5 (select (select (store (store .cse9 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse6) .cse4 v_ArrVal_1509) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse3 (select (select (store (store .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse8) .cse4 v_ArrVal_1508) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (= .cse3 .cse4) (= .cse5 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))))) (forall ((v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (_ BitVec 32)) (v_ArrVal_1499 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1499)) (.cse13 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse13 v_ArrVal_1505))) (= (select (select (store (store .cse11 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse12) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1500) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse13 v_ArrVal_1506) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1509) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select .cse12 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2021-12-18 22:10:36,439 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (_ BitVec 32)) (v_ArrVal_1499 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1499)) (.cse2 (bvadd |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv4 32)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 v_ArrVal_1505))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1500) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 v_ArrVal_1506) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1509) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1500))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv4 32)) v_ArrVal_1506))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse4) .cse5 v_ArrVal_1508) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse5))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (_ BitVec 32)) (v_ArrVal_1499 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1500)) (.cse13 (bvadd |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv4 32)))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse13 v_ArrVal_1506)) (.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1499))) (let ((.cse9 (store (select .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse13 v_ArrVal_1505)) (.cse7 (select .cse12 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse6 (select (select (store (store .cse11 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse12) .cse7 v_ArrVal_1508) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse8 (select (select (store (store .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse9) .cse7 v_ArrVal_1509) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (= .cse6 .cse7) (= .cse8 (select .cse9 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (= .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= .cse8 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))))) is different from false [2021-12-18 22:10:36,462 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:36,462 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 82 treesize of output 67 [2021-12-18 22:10:36,470 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:36,470 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 58 treesize of output 59 [2021-12-18 22:10:36,475 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 110 treesize of output 106 [2021-12-18 22:10:36,479 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 112 treesize of output 106 [2021-12-18 22:10:36,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:36,484 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 96 treesize of output 90 [2021-12-18 22:10:36,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:36,489 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 76 treesize of output 72 [2021-12-18 22:10:36,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:36,495 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 38 treesize of output 34 [2021-12-18 22:10:36,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:36,501 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 30 treesize of output 28 [2021-12-18 22:10:36,504 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 58 treesize of output 54 [2021-12-18 22:10:36,538 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 22:10:36,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 1 [2021-12-18 22:10:36,547 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 22:10:36,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 1 [2021-12-18 22:10:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-18 22:10:37,419 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:10:37,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251347737] [2021-12-18 22:10:37,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251347737] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:10:37,419 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:10:37,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 61 [2021-12-18 22:10:37,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926937038] [2021-12-18 22:10:37,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:10:37,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-12-18 22:10:37,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:10:37,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-12-18 22:10:37,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2318, Unknown=11, NotChecked=1166, Total=3660 [2021-12-18 22:10:37,421 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 61 states, 60 states have (on average 1.8) internal successors, (108), 55 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-18 22:10:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:10:45,326 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2021-12-18 22:10:45,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-18 22:10:45,327 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.8) internal successors, (108), 55 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2021-12-18 22:10:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:10:45,327 INFO L225 Difference]: With dead ends: 133 [2021-12-18 22:10:45,328 INFO L226 Difference]: Without dead ends: 133 [2021-12-18 22:10:45,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=436, Invalid=4999, Unknown=11, NotChecked=1694, Total=7140 [2021-12-18 22:10:45,329 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 348 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1435 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:10:45,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 1498 Invalid, 2825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1329 Invalid, 0 Unknown, 1435 Unchecked, 2.4s Time] [2021-12-18 22:10:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-18 22:10:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2021-12-18 22:10:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 100 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:10:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2021-12-18 22:10:45,331 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 59 [2021-12-18 22:10:45,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:10:45,331 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2021-12-18 22:10:45,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 1.8) internal successors, (108), 55 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-18 22:10:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2021-12-18 22:10:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-18 22:10:45,332 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:10:45,332 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:10:45,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-12-18 22:10:45,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:10:45,545 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:10:45,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:10:45,546 INFO L85 PathProgramCache]: Analyzing trace with hash -786361131, now seen corresponding path program 1 times [2021-12-18 22:10:45,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:10:45,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210417993] [2021-12-18 22:10:45,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:10:45,546 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:10:45,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:10:45,548 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:10:45,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-18 22:10:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:10:45,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 22:10:45,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:10:45,763 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 22:10:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:10:45,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:10:45,977 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:10:45,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210417993] [2021-12-18 22:10:45,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210417993] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:10:45,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:10:45,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 22:10:45,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311653947] [2021-12-18 22:10:45,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:10:45,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:10:45,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:10:45,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:10:45,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:10:45,978 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:10:46,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:10:46,507 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2021-12-18 22:10:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:10:46,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2021-12-18 22:10:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:10:46,508 INFO L225 Difference]: With dead ends: 123 [2021-12-18 22:10:46,508 INFO L226 Difference]: Without dead ends: 123 [2021-12-18 22:10:46,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-18 22:10:46,509 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 210 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:10:46,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 251 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 22:10:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-18 22:10:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2021-12-18 22:10:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 103 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:10:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2021-12-18 22:10:46,511 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 63 [2021-12-18 22:10:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:10:46,511 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2021-12-18 22:10:46,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:10:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2021-12-18 22:10:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-18 22:10:46,511 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:10:46,511 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:10:46,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-12-18 22:10:46,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:10:46,720 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:10:46,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:10:46,720 INFO L85 PathProgramCache]: Analyzing trace with hash -786361130, now seen corresponding path program 1 times [2021-12-18 22:10:46,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:10:46,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081948561] [2021-12-18 22:10:46,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:10:46,721 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:10:46,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:10:46,722 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:10:46,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-12-18 22:10:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:10:46,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 22:10:46,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:10:46,968 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 22:10:47,365 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:10:47,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:10:47,366 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:10:47,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081948561] [2021-12-18 22:10:47,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081948561] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:10:47,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:10:47,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 22:10:47,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806126136] [2021-12-18 22:10:47,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:10:47,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:10:47,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:10:47,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:10:47,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:10:47,367 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:10:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:10:47,922 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2021-12-18 22:10:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:10:47,922 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2021-12-18 22:10:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:10:47,923 INFO L225 Difference]: With dead ends: 106 [2021-12-18 22:10:47,923 INFO L226 Difference]: Without dead ends: 106 [2021-12-18 22:10:47,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-18 22:10:47,923 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 215 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:10:47,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 196 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 22:10:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-18 22:10:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-18 22:10:47,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 101 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:10:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2021-12-18 22:10:47,925 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 63 [2021-12-18 22:10:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:10:47,925 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2021-12-18 22:10:47,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:10:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2021-12-18 22:10:47,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-18 22:10:47,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:10:47,926 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:10:47,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2021-12-18 22:10:48,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:10:48,126 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:10:48,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:10:48,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1392642591, now seen corresponding path program 1 times [2021-12-18 22:10:48,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:10:48,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887758224] [2021-12-18 22:10:48,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:10:48,127 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:10:48,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:10:48,128 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:10:48,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-12-18 22:10:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:10:48,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 22:10:48,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:10:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:10:48,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:10:48,520 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:10:48,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887758224] [2021-12-18 22:10:48,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887758224] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:10:48,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:10:48,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 22:10:48,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603705264] [2021-12-18 22:10:48,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:10:48,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:10:48,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:10:48,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:10:48,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:10:48,521 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:10:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:10:48,826 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2021-12-18 22:10:48,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:10:48,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2021-12-18 22:10:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:10:48,827 INFO L225 Difference]: With dead ends: 106 [2021-12-18 22:10:48,827 INFO L226 Difference]: Without dead ends: 106 [2021-12-18 22:10:48,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-18 22:10:48,828 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 211 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:10:48,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 268 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 22:10:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-18 22:10:48,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-18 22:10:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 101 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:10:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2021-12-18 22:10:48,829 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 64 [2021-12-18 22:10:48,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:10:48,830 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2021-12-18 22:10:48,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:10:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2021-12-18 22:10:48,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-18 22:10:48,830 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:10:48,830 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:10:48,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2021-12-18 22:10:49,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:10:49,031 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:10:49,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:10:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1732740515, now seen corresponding path program 1 times [2021-12-18 22:10:49,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:10:49,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012539119] [2021-12-18 22:10:49,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:10:49,032 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:10:49,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:10:49,033 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:10:49,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-12-18 22:10:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:10:49,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-18 22:10:49,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:10:49,371 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 11 [2021-12-18 22:10:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-18 22:10:49,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:10:49,453 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-18 22:10:49,454 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 20 treesize of output 19 [2021-12-18 22:10:49,483 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-18 22:10:49,483 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 11 treesize of output 11 [2021-12-18 22:10:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-18 22:10:49,532 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:10:49,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012539119] [2021-12-18 22:10:49,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012539119] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:10:49,532 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:10:49,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-12-18 22:10:49,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082272645] [2021-12-18 22:10:49,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:10:49,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:10:49,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:10:49,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:10:49,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:10:49,533 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:10:50,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:10:50,405 INFO L93 Difference]: Finished difference Result 200 states and 209 transitions. [2021-12-18 22:10:50,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-18 22:10:50,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2021-12-18 22:10:50,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:10:50,406 INFO L225 Difference]: With dead ends: 200 [2021-12-18 22:10:50,406 INFO L226 Difference]: Without dead ends: 200 [2021-12-18 22:10:50,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2021-12-18 22:10:50,407 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 240 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 22:10:50,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 452 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-18 22:10:50,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-18 22:10:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 106. [2021-12-18 22:10:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.211111111111111) internal successors, (109), 101 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:10:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2021-12-18 22:10:50,411 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 66 [2021-12-18 22:10:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:10:50,411 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2021-12-18 22:10:50,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:10:50,411 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2021-12-18 22:10:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-18 22:10:50,411 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:10:50,411 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:10:50,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2021-12-18 22:10:50,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:10:50,612 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:10:50,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:10:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1732740514, now seen corresponding path program 1 times [2021-12-18 22:10:50,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:10:50,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985526547] [2021-12-18 22:10:50,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:10:50,613 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:10:50,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:10:50,614 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:10:50,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2021-12-18 22:10:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:10:50,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 93 conjunts are in the unsatisfiable core [2021-12-18 22:10:51,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:10:51,021 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 22:10:51,027 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 22:10:51,361 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 22:10:51,361 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 18 [2021-12-18 22:10:51,384 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:10:51,384 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 22:10:51,524 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 22:10:51,533 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 22:10:51,681 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:10:51,682 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 22:10:51,688 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 18 treesize of output 20 [2021-12-18 22:10:52,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:10:52,033 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 22:10:52,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:10:52,047 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 31 treesize of output 26 [2021-12-18 22:10:52,057 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 15 treesize of output 11 [2021-12-18 22:10:52,692 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:10:52,692 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 22:10:52,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:10:52,698 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 18 treesize of output 20 [2021-12-18 22:10:52,713 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 9 treesize of output 3 [2021-12-18 22:10:53,296 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 25 treesize of output 13 [2021-12-18 22:10:53,300 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 15 treesize of output 7 [2021-12-18 22:10:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:10:53,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:10:54,234 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1789) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1791) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1789) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) is different from false [2021-12-18 22:10:54,275 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1789) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1791) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1789) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) is different from false [2021-12-18 22:10:54,305 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1789) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1791) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1789) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse1 (bvadd .cse1 (_ bv4 32)))))) is different from false [2021-12-18 22:10:54,350 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1789) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1791) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1789) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse1 (bvadd .cse1 (_ bv4 32)))))) is different from false [2021-12-18 22:10:54,441 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1785 (_ BitVec 32)) (v_ArrVal_1784 (_ BitVec 32)) (v_ArrVal_1791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1785)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1784)) .cse1 v_ArrVal_1789) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1791) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((v_ArrVal_1785 (_ BitVec 32)) (v_ArrVal_1784 (_ BitVec 32)) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (let ((.cse4 (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_1784)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_1785)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1789)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse3 (bvadd .cse3 (_ bv4 32)))))) is different from false [2021-12-18 22:10:54,505 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1785 (_ BitVec 32)) (v_ArrVal_1784 (_ BitVec 32)) (v_ArrVal_1791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1785))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1784)) .cse1 v_ArrVal_1789) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse1 v_ArrVal_1791) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((v_ArrVal_1785 (_ BitVec 32)) (v_ArrVal_1784 (_ BitVec 32)) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_1784)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_1785) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1789)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse3 (bvadd .cse3 (_ bv4 32)))))) is different from false [2021-12-18 22:10:54,535 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1785 (_ BitVec 32)) (v_ArrVal_1784 (_ BitVec 32)) (v_ArrVal_1791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv4 32)))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse0 v_ArrVal_1785))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse0 v_ArrVal_1784)) .cse1 v_ArrVal_1789) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse2) .cse1 v_ArrVal_1791) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))))) (forall ((v_ArrVal_1785 (_ BitVec 32)) (v_ArrVal_1784 (_ BitVec 32)) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (let ((.cse4 (bvadd |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv4 32)))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse4 v_ArrVal_1784)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse4 v_ArrVal_1785) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1789)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule .cse3 (bvadd .cse3 (_ bv4 32)))))) is different from false [2021-12-18 22:10:54,568 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1785 (_ BitVec 32)) (v_ArrVal_1784 (_ BitVec 32)) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1784)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1785) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1789)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1785 (_ BitVec 32)) (v_ArrVal_1784 (_ BitVec 32)) (v_ArrVal_1791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1785))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1784)) .cse3 v_ArrVal_1789) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse4) .cse3 v_ArrVal_1791) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))) is different from false [2021-12-18 22:10:54,848 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1785 (_ BitVec 32)) (v_ArrVal_1784 (_ BitVec 32)) (v_ArrVal_1782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1781))) (store .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1784))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1782) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1785) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1789)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1785 (_ BitVec 32)) (v_ArrVal_1784 (_ BitVec 32)) (v_ArrVal_1782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1782)) (.cse4 (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1785))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1781))) (store .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1784))) .cse5 v_ArrVal_1789) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse7) .cse5 v_ArrVal_1791) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))) is different from false [2021-12-18 22:10:55,280 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1785 (_ BitVec 32)) (v_ArrVal_1784 (_ BitVec 32)) (v_ArrVal_1782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (bvadd |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv4 32)))) (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1781))) (store .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 v_ArrVal_1784))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1782) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 v_ArrVal_1785) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1789)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1785 (_ BitVec 32)) (v_ArrVal_1784 (_ BitVec 32)) (v_ArrVal_1782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1782)) (.cse4 (bvadd |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv4 32)))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1785))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1781))) (store .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1784))) .cse5 v_ArrVal_1789) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store (store .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse7) .cse5 v_ArrVal_1791) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))))) is different from false [2021-12-18 22:10:55,298 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:55,298 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 118 [2021-12-18 22:10:55,309 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:55,309 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 109 treesize of output 86 [2021-12-18 22:10:55,314 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 274 treesize of output 270 [2021-12-18 22:10:55,320 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 666 treesize of output 632 [2021-12-18 22:10:55,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:55,334 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 292 treesize of output 284 [2021-12-18 22:10:55,341 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:55,347 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 300 treesize of output 290 [2021-12-18 22:10:55,354 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 570 treesize of output 554 [2021-12-18 22:10:55,360 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 554 treesize of output 538 [2021-12-18 22:10:55,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:55,366 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 458 treesize of output 426 [2021-12-18 22:10:55,370 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 642 treesize of output 608 [2021-12-18 22:10:56,252 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:56,252 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 123 treesize of output 100 [2021-12-18 22:10:56,263 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:10:56,263 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 91 treesize of output 84 [2021-12-18 22:10:56,268 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 146 treesize of output 140 [2021-12-18 22:10:56,272 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 210 treesize of output 200 [2021-12-18 22:10:56,275 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:56,278 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 180 treesize of output 170 [2021-12-18 22:10:56,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:56,283 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 146 treesize of output 138 [2021-12-18 22:10:56,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:56,294 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 58 treesize of output 54 [2021-12-18 22:10:56,299 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:10:56,303 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 66 treesize of output 60 [2021-12-18 22:10:56,307 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 22:10:58,558 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:10:58,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985526547] [2021-12-18 22:10:58,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985526547] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:10:58,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1981726379] [2021-12-18 22:10:58,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:10:58,559 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 22:10:58,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 22:10:58,560 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 22:10:58,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2021-12-18 22:10:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:10:58,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 83 conjunts are in the unsatisfiable core [2021-12-18 22:10:58,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:10:59,004 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 22:10:59,778 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:10:59,778 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 22:11:00,037 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 22:11:00,324 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 22:11:00,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:11:00,902 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 22:11:01,283 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 7 treesize of output 3 [2021-12-18 22:11:01,664 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 22:11:01,665 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 33 treesize of output 37 [2021-12-18 22:11:01,670 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 17 treesize of output 13 [2021-12-18 22:11:01,695 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-12-18 22:11:02,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:11:02,613 INFO L354 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2021-12-18 22:11:02,613 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 43 treesize of output 42 [2021-12-18 22:11:04,107 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 23 treesize of output 15 [2021-12-18 22:11:04,111 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 26 treesize of output 14 [2021-12-18 22:11:04,417 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:11:04,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:11:04,707 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:11:04,708 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 38 treesize of output 42 [2021-12-18 22:11:05,718 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-18 22:11:05,718 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 11 treesize of output 11 [2021-12-18 22:11:08,446 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 40 treesize of output 34 [2021-12-18 22:11:09,169 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 47 treesize of output 35 [2021-12-18 22:11:09,253 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_216 (_ BitVec 32)) (v_ArrVal_1855 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (not (= |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.base| v_arrayElimCell_216)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_arrayElimCell_216 v_ArrVal_1855) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) is different from false [2021-12-18 22:11:09,422 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_216 (_ BitVec 32)) (v_ArrVal_1855 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_arrayElimCell_216 v_ArrVal_1855) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))) (and (not (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.base| v_arrayElimCell_216)))) is different from false [2021-12-18 22:11:09,496 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_216 (_ BitVec 32)) (v_ArrVal_1855 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_arrayElimCell_216 v_ArrVal_1855) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))) (and (not (= (_ bv0 32) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.base| v_arrayElimCell_216)))) is different from false [2021-12-18 22:11:09,658 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1853 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_ArrVal_1855 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)) v_ArrVal_1853)))) (or (and (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (not (= (_ bv0 32) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (= |c_ULTIMATE.start_main_~s~0#1.base| v_arrayElimCell_216)) (let ((.cse1 (select (select (store .cse0 v_arrayElimCell_216 v_ArrVal_1855) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) is different from false [2021-12-18 22:11:11,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1853 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_ArrVal_1851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1855 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1851))) (let ((.cse0 (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)) v_ArrVal_1853))) (or (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_arrayElimCell_216)) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) v_arrayElimCell_216 v_ArrVal_1855) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule .cse1 (bvadd .cse1 (_ bv4 32)))))))) is different from false [2021-12-18 22:11:11,540 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1853 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_ArrVal_1851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1855 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1851))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv4 32)) v_ArrVal_1853))) (or (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse2) v_arrayElimCell_216 v_ArrVal_1855) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_arrayElimCell_216)))))) is different from false [2021-12-18 22:11:11,556 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:11:11,557 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 111 treesize of output 79 [2021-12-18 22:11:11,560 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 134 treesize of output 126 [2021-12-18 22:11:11,564 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:11:11,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 62 treesize of output 56 [2021-12-18 22:11:11,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:11:11,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 62 treesize of output 54 [2021-12-18 22:11:11,581 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 58 treesize of output 50 [2021-12-18 22:11:13,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1981726379] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:11:13,030 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:11:13,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 35] total 61 [2021-12-18 22:11:13,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303689375] [2021-12-18 22:11:13,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:11:13,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-12-18 22:11:13,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:11:13,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-12-18 22:11:13,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=6941, Unknown=88, NotChecked=2960, Total=10506 [2021-12-18 22:11:13,033 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 62 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 56 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-18 22:11:22,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:11:22,110 INFO L93 Difference]: Finished difference Result 160 states and 165 transitions. [2021-12-18 22:11:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-18 22:11:22,111 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 56 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 66 [2021-12-18 22:11:22,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:11:22,112 INFO L225 Difference]: With dead ends: 160 [2021-12-18 22:11:22,112 INFO L226 Difference]: Without dead ends: 160 [2021-12-18 22:11:22,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 127 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 3797 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=1121, Invalid=11506, Unknown=93, NotChecked=3792, Total=16512 [2021-12-18 22:11:22,113 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 500 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-18 22:11:22,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 1093 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1383 Invalid, 0 Unknown, 130 Unchecked, 2.7s Time] [2021-12-18 22:11:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-18 22:11:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 108. [2021-12-18 22:11:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.1956521739130435) internal successors, (110), 103 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:11:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2021-12-18 22:11:22,115 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 66 [2021-12-18 22:11:22,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:11:22,115 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2021-12-18 22:11:22,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 56 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-18 22:11:22,115 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2021-12-18 22:11:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-18 22:11:22,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:11:22,116 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2021-12-18 22:11:22,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2021-12-18 22:11:22,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2021-12-18 22:11:22,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-18 22:11:22,525 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:11:22,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:11:22,525 INFO L85 PathProgramCache]: Analyzing trace with hash -720162444, now seen corresponding path program 2 times [2021-12-18 22:11:22,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:11:22,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620826376] [2021-12-18 22:11:22,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:11:22,526 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:11:22,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:11:22,527 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:11:22,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2021-12-18 22:11:22,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:11:22,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:11:22,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:11:22,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:11:22,928 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-18 22:11:22,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:11:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-18 22:11:23,098 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:11:23,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620826376] [2021-12-18 22:11:23,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620826376] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:11:23,099 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:11:23,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-18 22:11:23,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614301039] [2021-12-18 22:11:23,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:11:23,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:11:23,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:11:23,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:11:23,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:11:23,100 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:11:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:11:23,382 INFO L93 Difference]: Finished difference Result 238 states and 255 transitions. [2021-12-18 22:11:23,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 22:11:23,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2021-12-18 22:11:23,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:11:23,383 INFO L225 Difference]: With dead ends: 238 [2021-12-18 22:11:23,383 INFO L226 Difference]: Without dead ends: 238 [2021-12-18 22:11:23,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2021-12-18 22:11:23,384 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 298 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:11:23,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 513 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:11:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-18 22:11:23,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 114. [2021-12-18 22:11:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.183673469387755) internal successors, (116), 109 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:11:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2021-12-18 22:11:23,386 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 66 [2021-12-18 22:11:23,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:11:23,386 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2021-12-18 22:11:23,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:11:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2021-12-18 22:11:23,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-18 22:11:23,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:11:23,387 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:11:23,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2021-12-18 22:11:23,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:11:23,596 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:11:23,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:11:23,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2119617500, now seen corresponding path program 1 times [2021-12-18 22:11:23,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:11:23,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938567738] [2021-12-18 22:11:23,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:11:23,596 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:11:23,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:11:23,597 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:11:23,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2021-12-18 22:11:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:11:23,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-18 22:11:23,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:11:24,892 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:11:24,892 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 38 treesize of output 36 [2021-12-18 22:11:25,404 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 25 treesize of output 17 [2021-12-18 22:11:25,407 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 21 treesize of output 13 [2021-12-18 22:11:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 22:11:25,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:11:26,336 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:11:26,336 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 27 treesize of output 30 [2021-12-18 22:11:26,357 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:11:26,357 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 23 treesize of output 26 [2021-12-18 22:11:27,399 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:11:27,400 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 24 treesize of output 27 [2021-12-18 22:11:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 22:11:27,615 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:11:27,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938567738] [2021-12-18 22:11:27,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938567738] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:11:27,615 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:11:27,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 43 [2021-12-18 22:11:27,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542313166] [2021-12-18 22:11:27,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:11:27,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-18 22:11:27,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:11:27,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-18 22:11:27,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1661, Unknown=0, NotChecked=0, Total=1806 [2021-12-18 22:11:27,616 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 42 states have internal predecessors, (101), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:11:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:11:33,839 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2021-12-18 22:11:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-18 22:11:33,839 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 42 states have internal predecessors, (101), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2021-12-18 22:11:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:11:33,840 INFO L225 Difference]: With dead ends: 142 [2021-12-18 22:11:33,840 INFO L226 Difference]: Without dead ends: 142 [2021-12-18 22:11:33,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=592, Invalid=3698, Unknown=0, NotChecked=0, Total=4290 [2021-12-18 22:11:33,841 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 488 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-18 22:11:33,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 935 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1275 Invalid, 0 Unknown, 67 Unchecked, 2.9s Time] [2021-12-18 22:11:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-18 22:11:33,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 119. [2021-12-18 22:11:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.174757281553398) internal successors, (121), 114 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:11:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2021-12-18 22:11:33,843 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 67 [2021-12-18 22:11:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:11:33,843 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2021-12-18 22:11:33,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 42 states have internal predecessors, (101), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:11:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2021-12-18 22:11:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-18 22:11:33,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:11:33,843 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 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, 1] [2021-12-18 22:11:33,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Ended with exit code 0 [2021-12-18 22:11:34,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:11:34,047 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:11:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:11:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash 768775417, now seen corresponding path program 2 times [2021-12-18 22:11:34,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:11:34,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862633264] [2021-12-18 22:11:34,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:11:34,048 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:11:34,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:11:34,050 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:11:34,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2021-12-18 22:11:34,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:11:34,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:11:34,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:11:34,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:11:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 22:11:34,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:11:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 22:11:34,835 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:11:34,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862633264] [2021-12-18 22:11:34,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862633264] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:11:34,835 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:11:34,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-18 22:11:34,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956544291] [2021-12-18 22:11:34,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:11:34,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:11:34,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:11:34,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:11:34,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:11:34,836 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:11:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:11:34,939 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2021-12-18 22:11:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:11:34,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2021-12-18 22:11:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:11:34,940 INFO L225 Difference]: With dead ends: 86 [2021-12-18 22:11:34,940 INFO L226 Difference]: Without dead ends: 86 [2021-12-18 22:11:34,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:11:34,940 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 54 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:11:34,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 304 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:11:34,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-18 22:11:34,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-12-18 22:11:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 81 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:11:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2021-12-18 22:11:34,942 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 68 [2021-12-18 22:11:34,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:11:34,942 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2021-12-18 22:11:34,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:11:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2021-12-18 22:11:34,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-18 22:11:34,942 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:11:34,942 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:11:34,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2021-12-18 22:11:35,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:11:35,143 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:11:35,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:11:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1139341665, now seen corresponding path program 1 times [2021-12-18 22:11:35,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:11:35,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191081997] [2021-12-18 22:11:35,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:11:35,144 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:11:35,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:11:35,144 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:11:35,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2021-12-18 22:11:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:11:35,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-18 22:11:35,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:11:35,738 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 22:11:35,738 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 19 treesize of output 26 [2021-12-18 22:11:35,829 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 17 treesize of output 13 [2021-12-18 22:11:36,039 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-18 22:11:36,040 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 22:11:36,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 22:11:36,354 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:11:36,354 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2021-12-18 22:11:36,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:11:36,616 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 37 treesize of output 28 [2021-12-18 22:11:36,900 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:11:36,900 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2021-12-18 22:11:37,308 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 31 treesize of output 15 [2021-12-18 22:11:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-18 22:11:37,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:11:38,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2071) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2021-12-18 22:11:38,268 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (_ BitVec 32)) (v_ArrVal_2071 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)) v_ArrVal_2070)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2071)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2021-12-18 22:11:38,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (_ BitVec 32)) (v_ArrVal_2071 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv4 32)) v_ArrVal_2070))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2071)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) |c_#StackHeapBarrier|)) is different from false [2021-12-18 22:11:38,465 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (_ BitVec 32)) (v_ArrVal_2071 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)) v_ArrVal_2070))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2071)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2021-12-18 22:11:38,912 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:11:38,912 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 62 treesize of output 47 [2021-12-18 22:11:38,923 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 102 treesize of output 94 [2021-12-18 22:11:38,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:11:38,929 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 36 treesize of output 28 [2021-12-18 22:11:38,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:11:38,935 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 28 treesize of output 22 [2021-12-18 22:11:38,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 46 treesize of output 42 [2021-12-18 22:11:39,390 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:11:39,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191081997] [2021-12-18 22:11:39,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191081997] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:11:39,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2008310797] [2021-12-18 22:11:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:11:39,391 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 22:11:39,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 22:11:39,392 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 22:11:39,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2021-12-18 22:11:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:11:39,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-18 22:11:39,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:11:39,957 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 22:11:40,457 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 8 treesize of output 6 [2021-12-18 22:11:40,557 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:11:40,558 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 22:11:40,848 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 22:11:40,866 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 22:11:41,175 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:11:41,175 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-18 22:11:41,180 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 18 treesize of output 20 [2021-12-18 22:11:41,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:11:41,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 29 treesize of output 24 [2021-12-18 22:11:41,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:11:41,884 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 22:11:42,469 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 15 treesize of output 7 [2021-12-18 22:11:42,943 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:11:42,944 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-12-18 22:11:42,949 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 21 treesize of output 13 [2021-12-18 22:11:43,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:11:43,621 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 0 case distinctions, treesize of input 23 treesize of output 9 [2021-12-18 22:11:44,539 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 23 treesize of output 11 [2021-12-18 22:11:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 22:11:44,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:11:45,701 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 40 treesize of output 34 [2021-12-18 22:11:48,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2132 (_ BitVec 32))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2130))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)) v_ArrVal_2132))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (bvult (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) .cse2 v_ArrVal_2135) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2) (forall ((v_ArrVal_2131 (_ BitVec 32)) (v_ArrVal_2129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2129) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)) v_ArrVal_2131) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))))) is different from false [2021-12-18 22:11:48,481 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2132 (_ BitVec 32))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2130))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv4 32)) v_ArrVal_2132))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (forall ((v_ArrVal_2131 (_ BitVec 32)) (v_ArrVal_2129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2129) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv4 32)) v_ArrVal_2131) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0)) (bvult (select (select (store (store .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_2135) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)))))) is different from false [2021-12-18 22:11:48,494 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:11:48,495 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 110 treesize of output 86 [2021-12-18 22:11:48,503 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:11:48,503 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 86 treesize of output 86 [2021-12-18 22:11:48,507 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 158 treesize of output 148 [2021-12-18 22:11:48,510 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 196 treesize of output 188 [2021-12-18 22:11:48,513 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 236 treesize of output 226 [2021-12-18 22:11:48,517 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 243 treesize of output 239 [2021-12-18 22:11:48,521 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 251 treesize of output 247 [2021-12-18 22:11:48,524 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 247 treesize of output 243 [2021-12-18 22:11:48,537 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:11:48,541 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 84 [2021-12-18 22:11:51,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2008310797] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:11:51,750 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:11:51,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 31] total 49 [2021-12-18 22:11:51,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720402406] [2021-12-18 22:11:51,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:11:51,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-18 22:11:51,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:11:51,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-18 22:11:51,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=5567, Unknown=152, NotChecked=954, Total=7140 [2021-12-18 22:11:51,752 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand has 50 states, 48 states have (on average 2.3541666666666665) internal successors, (113), 45 states have internal predecessors, (113), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-18 22:12:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:12:02,127 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2021-12-18 22:12:02,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-18 22:12:02,128 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.3541666666666665) internal successors, (113), 45 states have internal predecessors, (113), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 69 [2021-12-18 22:12:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:12:02,129 INFO L225 Difference]: With dead ends: 88 [2021-12-18 22:12:02,129 INFO L226 Difference]: Without dead ends: 88 [2021-12-18 22:12:02,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 112 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2764 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=1226, Invalid=10201, Unknown=153, NotChecked=1302, Total=12882 [2021-12-18 22:12:02,130 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 637 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-18 22:12:02,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 590 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1248 Invalid, 0 Unknown, 105 Unchecked, 2.9s Time] [2021-12-18 22:12:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-18 22:12:02,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2021-12-18 22:12:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 82 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:12:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2021-12-18 22:12:02,132 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 69 [2021-12-18 22:12:02,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:12:02,132 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2021-12-18 22:12:02,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.3541666666666665) internal successors, (113), 45 states have internal predecessors, (113), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-18 22:12:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2021-12-18 22:12:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-18 22:12:02,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:12:02,132 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:12:02,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (44)] Forceful destruction successful, exit code 0 [2021-12-18 22:12:02,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Ended with exit code 0 [2021-12-18 22:12:02,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:12:02,533 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:12:02,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:12:02,533 INFO L85 PathProgramCache]: Analyzing trace with hash -998839710, now seen corresponding path program 1 times [2021-12-18 22:12:02,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:12:02,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858237014] [2021-12-18 22:12:02,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:12:02,534 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:12:02,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:12:02,535 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:12:02,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2021-12-18 22:12:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:12:02,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 77 conjunts are in the unsatisfiable core [2021-12-18 22:12:02,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:12:02,973 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 22:12:03,182 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:12:03,183 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 22:12:03,273 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 22:12:03,406 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-18 22:12:03,406 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-12-18 22:12:03,411 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 19 treesize of output 11 [2021-12-18 22:12:03,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:12:03,719 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 22:12:03,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2021-12-18 22:12:03,725 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 18 treesize of output 20 [2021-12-18 22:12:04,107 INFO L354 Elim1Store]: treesize reduction 121, result has 18.8 percent of original size [2021-12-18 22:12:04,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 78 [2021-12-18 22:12:04,134 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-18 22:12:04,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 59 [2021-12-18 22:12:05,167 INFO L354 Elim1Store]: treesize reduction 45, result has 15.1 percent of original size [2021-12-18 22:12:05,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 59 [2021-12-18 22:12:05,185 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:12:05,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 45 treesize of output 33 [2021-12-18 22:12:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-18 22:12:05,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:12:24,189 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2203 (_ BitVec 32)) (v_ArrVal_2200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2199 (_ BitVec 32))) (or (and (forall ((v_ArrVal_2204 (_ BitVec 32))) (= (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2200)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)) v_ArrVal_2199)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse3 (bvadd (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)))) (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 v_ArrVal_2203)))) (select (select .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_2204)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) |c_ULTIMATE.start_main_~s~0#1.offset|)) (forall ((v_ArrVal_2204 (_ BitVec 32))) (= (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2200)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)) v_ArrVal_2199)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse8 (bvadd (select (select .cse9 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)))) (select (let ((.cse5 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_ArrVal_2204)))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 v_ArrVal_2203)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) |c_ULTIMATE.start_main_~s~0#1.base|))) (not (= (_ bv0 32) (select (select (let ((.cse11 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (_ bv4 32)) v_ArrVal_2199)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2200))) (store .cse10 .cse11 (store (select .cse10 .cse11) (bvadd (select (select .cse10 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) v_ArrVal_2203))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-18 22:12:24,425 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2203 (_ BitVec 32)) (v_ArrVal_2200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2199 (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2200)) (.cse1 (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_2199) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd (select v_ArrVal_2200 |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) v_ArrVal_2203))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_2204 (_ BitVec 32))) (= (let ((.cse6 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_2199))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse5 (bvadd (select v_ArrVal_2200 |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)))) (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse6))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_2204))))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2200))) (store .cse7 .cse4 (store (select .cse7 .cse4) .cse5 v_ArrVal_2203))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_ArrVal_2204 (_ BitVec 32))) (= (let ((.cse12 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_2199))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse11 (bvadd (select v_ArrVal_2200 |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)))) (let ((.cse8 (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2200))) (store .cse13 .cse10 (store (select .cse13 .cse10) .cse11 v_ArrVal_2203))))) (select (select .cse8 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse12))) (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 v_ArrVal_2204))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select (select .cse8 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-18 22:12:24,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2203 (_ BitVec 32)) (v_ArrVal_2200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2199 (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_2200)) (.cse1 (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv4 32)) v_ArrVal_2199) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd (select v_ArrVal_2200 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (_ bv4 32)) v_ArrVal_2203))) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (forall ((v_ArrVal_2204 (_ BitVec 32))) (= (let ((.cse6 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv4 32)) v_ArrVal_2199))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse5 (bvadd (select v_ArrVal_2200 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (_ bv4 32)))) (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse6))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_2204))))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_2200))) (store .cse7 .cse4 (store (select .cse7 .cse4) .cse5 v_ArrVal_2203))) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (forall ((v_ArrVal_2204 (_ BitVec 32))) (= (let ((.cse12 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv4 32)) v_ArrVal_2199))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse11 (bvadd (select v_ArrVal_2200 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (_ bv4 32)))) (let ((.cse8 (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_2200))) (store .cse13 .cse10 (store (select .cse13 .cse10) .cse11 v_ArrVal_2203))))) (select (select .cse8 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse12))) (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 v_ArrVal_2204))) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select (select .cse8 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) is different from false [2021-12-18 22:12:24,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2203 (_ BitVec 32)) (v_ArrVal_2200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2199 (_ BitVec 32))) (or (and (forall ((v_ArrVal_2204 (_ BitVec 32))) (= (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)) v_ArrVal_2199))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse3 (bvadd (select v_ArrVal_2200 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv4 32)))) (let ((.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2200))) (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_2203))))) (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse4))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_2204))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (forall ((v_ArrVal_2204 (_ BitVec 32))) (= (let ((.cse10 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)) v_ArrVal_2199))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse9 (bvadd (select v_ArrVal_2200 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv4 32)))) (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse10))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 v_ArrVal_2204))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2200))) (store .cse11 .cse8 (store (select .cse11 .cse8) .cse9 v_ArrVal_2203))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (not (= (_ bv0 32) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2200)) (.cse13 (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (_ bv4 32)) v_ArrVal_2199) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse12 .cse13 (store (select .cse12 .cse13) (bvadd (select v_ArrVal_2200 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv4 32)) v_ArrVal_2203))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-18 22:12:24,713 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:12:24,713 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 606 treesize of output 550 [2021-12-18 22:12:24,840 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:12:24,840 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 7064 treesize of output 6510 [2021-12-18 22:12:25,140 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:12:25,140 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 7099 treesize of output 6819 [2021-12-18 22:12:25,226 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 6 treesize of output 4 [2021-12-18 22:12:39,693 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 5 treesize of output 3 [2021-12-18 22:12:48,878 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 6 treesize of output 4 [2021-12-18 22:12:50,798 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:12:50,798 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 1143 treesize of output 1147 [2021-12-18 22:12:58,662 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:12:58,662 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 6606 treesize of output 6636 [2021-12-18 22:20:59,742 WARN L227 SmtUtils]: Spent 2.70m on a formula simplification. DAG size of input: 2322 DAG size of output: 1995 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-18 22:20:59,747 INFO L354 Elim1Store]: treesize reduction 1560, result has 71.6 percent of original size [2021-12-18 22:20:59,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 30 select indices, 30 select index equivalence classes, 0 disjoint index pairs (out of 435 index pairs), introduced 31 new quantified variables, introduced 467 case distinctions, treesize of input 34543430 treesize of output 19739587 Killed by 15