./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF --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 c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:15:16,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:15:16,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:15:16,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:15:16,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:15:16,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:15:16,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:15:16,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:15:16,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:15:16,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:15:16,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:15:16,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:15:16,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:15:16,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:15:16,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:15:16,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:15:16,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:15:16,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:15:16,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:15:16,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:15:16,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:15:16,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:15:16,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:15:16,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:15:16,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:15:16,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:15:16,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:15:16,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:15:16,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:15:16,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:15:16,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:15:16,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:15:16,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:15:16,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:15:16,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:15:16,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:15:16,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:15:16,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:15:16,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:15:16,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:15:16,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:15:16,878 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-20 06:15:16,928 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:15:16,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:15:16,930 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:15:16,930 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:15:16,931 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:15:16,931 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:15:16,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:15:16,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:15:16,933 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:15:16,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:15:16,934 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:15:16,935 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 06:15:16,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:15:16,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:15:16,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:15:16,936 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 06:15:16,936 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 06:15:16,936 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-20 06:15:16,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:15:16,937 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 06:15:16,937 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:15:16,937 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:15:16,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:15:16,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:15:16,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:15:16,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:15:16,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:15:16,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:15:16,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:15:16,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 06:15:16,940 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:15:16,940 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF 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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2021-11-20 06:15:17,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:15:17,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:15:17,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:15:17,243 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:15:17,244 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:15:17,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/list-simple/dll2n_update_all.i [2021-11-20 06:15:17,305 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/data/664381ec4/8c0a79211fe34d1cad90b1af0439cb19/FLAG71da8c28a [2021-11-20 06:15:17,853 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:15:17,855 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/sv-benchmarks/c/list-simple/dll2n_update_all.i [2021-11-20 06:15:17,877 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/data/664381ec4/8c0a79211fe34d1cad90b1af0439cb19/FLAG71da8c28a [2021-11-20 06:15:18,176 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/data/664381ec4/8c0a79211fe34d1cad90b1af0439cb19 [2021-11-20 06:15:18,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:15:18,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:15:18,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:15:18,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:15:18,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:15:18,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:15:18" (1/1) ... [2021-11-20 06:15:18,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dcbc382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:18, skipping insertion in model container [2021-11-20 06:15:18,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:15:18" (1/1) ... [2021-11-20 06:15:18,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:15:18,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:15:18,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2021-11-20 06:15:18,578 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:15:18,586 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:15:18,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2021-11-20 06:15:18,633 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:15:18,664 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:15:18,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:18 WrapperNode [2021-11-20 06:15:18,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:15:18,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:15:18,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:15:18,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:15:18,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:18" (1/1) ... [2021-11-20 06:15:18,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:18" (1/1) ... [2021-11-20 06:15:18,740 INFO L137 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2021-11-20 06:15:18,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:15:18,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:15:18,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:15:18,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:15:18,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:18" (1/1) ... [2021-11-20 06:15:18,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:18" (1/1) ... [2021-11-20 06:15:18,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:18" (1/1) ... [2021-11-20 06:15:18,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:18" (1/1) ... [2021-11-20 06:15:18,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:18" (1/1) ... [2021-11-20 06:15:18,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:18" (1/1) ... [2021-11-20 06:15:18,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:18" (1/1) ... [2021-11-20 06:15:18,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:15:18,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:15:18,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:15:18,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:15:18,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:18" (1/1) ... [2021-11-20 06:15:18,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:15:18,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:15:18,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 06:15:18,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 06:15:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-11-20 06:15:18,905 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-11-20 06:15:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 06:15:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 06:15:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 06:15:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 06:15:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 06:15:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 06:15:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 06:15:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 06:15:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:15:18,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:15:19,005 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:15:19,016 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:15:19,068 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-11-20 06:15:19,342 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:15:19,350 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:15:19,350 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-20 06:15:19,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:15:19 BoogieIcfgContainer [2021-11-20 06:15:19,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:15:19,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 06:15:19,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 06:15:19,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 06:15:19,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:15:18" (1/3) ... [2021-11-20 06:15:19,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb80b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:15:19, skipping insertion in model container [2021-11-20 06:15:19,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:18" (2/3) ... [2021-11-20 06:15:19,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb80b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:15:19, skipping insertion in model container [2021-11-20 06:15:19,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:15:19" (3/3) ... [2021-11-20 06:15:19,364 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2021-11-20 06:15:19,369 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 06:15:19,370 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2021-11-20 06:15:19,419 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 06:15:19,431 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-11-20 06:15:19,431 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2021-11-20 06:15:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 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-11-20 06:15:19,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-20 06:15:19,476 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:19,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-20 06:15:19,477 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:19,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2021-11-20 06:15:19,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:19,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480464359] [2021-11-20 06:15:19,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:19,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:19,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:19,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480464359] [2021-11-20 06:15:19,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480464359] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:15:19,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:15:19,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 06:15:19,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399696931] [2021-11-20 06:15:19,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:15:19,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 06:15:19,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:19,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 06:15:19,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:15:19,805 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:19,956 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2021-11-20 06:15:19,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:15:19,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-20 06:15:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:19,972 INFO L225 Difference]: With dead ends: 111 [2021-11-20 06:15:19,972 INFO L226 Difference]: Without dead ends: 104 [2021-11-20 06:15:19,975 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-11-20 06:15:19,981 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:19,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:15:20,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-11-20 06:15:20,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2021-11-20 06:15:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2021-11-20 06:15:20,032 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2021-11-20 06:15:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:20,033 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2021-11-20 06:15:20,033 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2021-11-20 06:15:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-20 06:15:20,034 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:20,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-20 06:15:20,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 06:15:20,035 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:20,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:20,040 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2021-11-20 06:15:20,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:20,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242418818] [2021-11-20 06:15:20,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:20,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:20,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:20,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242418818] [2021-11-20 06:15:20,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242418818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:15:20,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:15:20,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 06:15:20,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746474469] [2021-11-20 06:15:20,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:15:20,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 06:15:20,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:20,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 06:15:20,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:15:20,122 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:20,218 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2021-11-20 06:15:20,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:15:20,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-20 06:15:20,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:20,221 INFO L225 Difference]: With dead ends: 101 [2021-11-20 06:15:20,221 INFO L226 Difference]: Without dead ends: 101 [2021-11-20 06:15:20,222 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-11-20 06:15:20,223 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:20,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:15:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-20 06:15:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2021-11-20 06:15:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2021-11-20 06:15:20,244 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2021-11-20 06:15:20,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:20,245 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2021-11-20 06:15:20,245 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2021-11-20 06:15:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-20 06:15:20,246 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:20,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:15:20,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 06:15:20,247 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:20,248 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2021-11-20 06:15:20,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:20,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700570677] [2021-11-20 06:15:20,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:20,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:20,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:20,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700570677] [2021-11-20 06:15:20,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700570677] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:15:20,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:15:20,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 06:15:20,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243547395] [2021-11-20 06:15:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:15:20,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 06:15:20,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:20,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 06:15:20,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:15:20,310 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:20,320 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2021-11-20 06:15:20,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:15:20,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-20 06:15:20,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:20,321 INFO L225 Difference]: With dead ends: 66 [2021-11-20 06:15:20,322 INFO L226 Difference]: Without dead ends: 66 [2021-11-20 06:15:20,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:15:20,324 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 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-11-20 06:15:20,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:15:20,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-20 06:15:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2021-11-20 06:15:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2021-11-20 06:15:20,331 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2021-11-20 06:15:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:20,332 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2021-11-20 06:15:20,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2021-11-20 06:15:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-20 06:15:20,333 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:20,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:15:20,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 06:15:20,334 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:20,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:20,334 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2021-11-20 06:15:20,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:20,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499326945] [2021-11-20 06:15:20,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:20,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:20,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:20,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499326945] [2021-11-20 06:15:20,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499326945] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:15:20,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:15:20,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 06:15:20,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067270865] [2021-11-20 06:15:20,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:15:20,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 06:15:20,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:20,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 06:15:20,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:15:20,390 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:20,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:20,407 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2021-11-20 06:15:20,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:15:20,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-20 06:15:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:20,409 INFO L225 Difference]: With dead ends: 63 [2021-11-20 06:15:20,409 INFO L226 Difference]: Without dead ends: 63 [2021-11-20 06:15:20,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:15:20,411 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 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-11-20 06:15:20,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:15:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-20 06:15:20,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-11-20 06:15:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2021-11-20 06:15:20,418 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2021-11-20 06:15:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:20,419 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2021-11-20 06:15:20,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-11-20 06:15:20,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-20 06:15:20,420 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:20,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:15:20,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 06:15:20,421 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:20,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:20,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2021-11-20 06:15:20,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:20,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699537860] [2021-11-20 06:15:20,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:20,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:20,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:20,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699537860] [2021-11-20 06:15:20,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699537860] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:15:20,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392758085] [2021-11-20 06:15:20,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:20,486 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:15:20,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:15:20,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:15:20,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 06:15:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:20,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:15:20,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:15:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:20,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:15:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:20,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392758085] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:15:20,824 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:15:20,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-11-20 06:15:20,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897578609] [2021-11-20 06:15:20,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:15:20,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:15:20,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:20,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:15:20,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:15:20,825 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:20,843 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-11-20 06:15:20,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:15:20,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-20 06:15:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:20,845 INFO L225 Difference]: With dead ends: 64 [2021-11-20 06:15:20,845 INFO L226 Difference]: Without dead ends: 64 [2021-11-20 06:15:20,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:15:20,847 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:20,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:15:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-20 06:15:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-11-20 06:15:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2021-11-20 06:15:20,853 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2021-11-20 06:15:20,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:20,854 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2021-11-20 06:15:20,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:20,854 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2021-11-20 06:15:20,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-20 06:15:20,855 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:20,855 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-20 06:15:20,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-20 06:15:21,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:15:21,071 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:21,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2021-11-20 06:15:21,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:21,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304993746] [2021-11-20 06:15:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:21,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:21,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:21,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304993746] [2021-11-20 06:15:21,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304993746] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:15:21,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860502138] [2021-11-20 06:15:21,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:21,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:15:21,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:15:21,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:15:21,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 06:15:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:21,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:15:21,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:15:21,375 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-11-20 06:15:21,428 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 06:15:21,428 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-11-20 06:15:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:21,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:15:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:21,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860502138] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:15:21,788 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:15:21,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-20 06:15:21,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093675899] [2021-11-20 06:15:21,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:15:21,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 06:15:21,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:21,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 06:15:21,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:15:21,793 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:21,878 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2021-11-20 06:15:21,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:15:21,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-20 06:15:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:21,885 INFO L225 Difference]: With dead ends: 130 [2021-11-20 06:15:21,885 INFO L226 Difference]: Without dead ends: 130 [2021-11-20 06:15:21,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:15:21,894 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 290 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:21,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 154 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 107 Unchecked, 0.0s Time] [2021-11-20 06:15:21,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-20 06:15:21,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 72. [2021-11-20 06:15:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2021-11-20 06:15:21,911 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2021-11-20 06:15:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:21,911 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2021-11-20 06:15:21,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2021-11-20 06:15:21,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-20 06:15:21,913 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:21,913 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-20 06:15:21,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 06:15:22,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-20 06:15:22,128 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2021-11-20 06:15:22,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:22,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299480948] [2021-11-20 06:15:22,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:22,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:22,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:22,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299480948] [2021-11-20 06:15:22,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299480948] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:15:22,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250032839] [2021-11-20 06:15:22,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:22,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:15:22,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:15:22,256 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:15:22,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 06:15:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:22,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-20 06:15:22,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:15:22,352 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-11-20 06:15:22,474 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:15:22,475 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 22 treesize of output 24 [2021-11-20 06:15:22,485 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:15:22,486 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 21 treesize of output 21 [2021-11-20 06:15:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:22,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:15:22,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2021-11-20 06:15:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:23,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250032839] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:15:23,040 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:15:23,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2021-11-20 06:15:23,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23897978] [2021-11-20 06:15:23,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:15:23,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 06:15:23,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:23,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 06:15:23,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:15:23,042 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:23,227 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2021-11-20 06:15:23,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:15:23,230 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-20 06:15:23,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:23,231 INFO L225 Difference]: With dead ends: 131 [2021-11-20 06:15:23,232 INFO L226 Difference]: Without dead ends: 131 [2021-11-20 06:15:23,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-11-20 06:15:23,233 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 281 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:23,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 321 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 146 Unchecked, 0.1s Time] [2021-11-20 06:15:23,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-11-20 06:15:23,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 72. [2021-11-20 06:15:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2021-11-20 06:15:23,240 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 16 [2021-11-20 06:15:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:23,241 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2021-11-20 06:15:23,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2021-11-20 06:15:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 06:15:23,242 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:23,242 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:15:23,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 06:15:23,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:15:23,464 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:23,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2021-11-20 06:15:23,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:23,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263931007] [2021-11-20 06:15:23,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:23,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:23,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:23,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263931007] [2021-11-20 06:15:23,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263931007] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:15:23,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28038699] [2021-11-20 06:15:23,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:15:23,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:15:23,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:15:23,509 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:15:23,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 06:15:23,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-20 06:15:23,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:15:23,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:15:23,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:15:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:15:23,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:15:23,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28038699] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:15:23,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:15:23,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-11-20 06:15:23,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868854253] [2021-11-20 06:15:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:15:23,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:15:23,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:23,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:15:23,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:15:23,634 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:23,680 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2021-11-20 06:15:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:15:23,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-20 06:15:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:23,682 INFO L225 Difference]: With dead ends: 170 [2021-11-20 06:15:23,683 INFO L226 Difference]: Without dead ends: 170 [2021-11-20 06:15:23,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-11-20 06:15:23,684 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 113 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:23,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 218 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:15:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-11-20 06:15:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 74. [2021-11-20 06:15:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.456140350877193) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2021-11-20 06:15:23,705 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 22 [2021-11-20 06:15:23,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:23,705 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2021-11-20 06:15:23,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2021-11-20 06:15:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 06:15:23,706 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:23,707 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:15:23,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-20 06:15:23,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:15:23,920 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:23,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:23,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969322, now seen corresponding path program 1 times [2021-11-20 06:15:23,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:23,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088445797] [2021-11-20 06:15:23,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:23,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:23,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:23,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088445797] [2021-11-20 06:15:23,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088445797] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:15:23,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340267560] [2021-11-20 06:15:23,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:23,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:15:23,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:15:23,960 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:15:23,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 06:15:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:24,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:15:24,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:15:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:24,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:15:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:24,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340267560] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:15:24,123 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:15:24,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-11-20 06:15:24,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672343668] [2021-11-20 06:15:24,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:15:24,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:15:24,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:24,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:15:24,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:15:24,126 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:24,154 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2021-11-20 06:15:24,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:15:24,155 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-20 06:15:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:24,156 INFO L225 Difference]: With dead ends: 72 [2021-11-20 06:15:24,156 INFO L226 Difference]: Without dead ends: 72 [2021-11-20 06:15:24,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-11-20 06:15:24,159 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:24,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 56 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:15:24,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-20 06:15:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-11-20 06:15:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2021-11-20 06:15:24,168 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 22 [2021-11-20 06:15:24,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:24,169 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2021-11-20 06:15:24,169 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2021-11-20 06:15:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-20 06:15:24,173 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:24,173 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:15:24,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-20 06:15:24,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:15:24,388 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:24,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:24,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022437, now seen corresponding path program 1 times [2021-11-20 06:15:24,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:24,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96540610] [2021-11-20 06:15:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:24,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 06:15:24,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:24,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96540610] [2021-11-20 06:15:24,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96540610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:15:24,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:15:24,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:15:24,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446883798] [2021-11-20 06:15:24,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:15:24,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:15:24,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:24,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:15:24,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:15:24,488 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:24,642 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2021-11-20 06:15:24,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:15:24,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-20 06:15:24,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:24,644 INFO L225 Difference]: With dead ends: 121 [2021-11-20 06:15:24,644 INFO L226 Difference]: Without dead ends: 121 [2021-11-20 06:15:24,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-20 06:15:24,645 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 261 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:24,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 123 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:15:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-20 06:15:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 74. [2021-11-20 06:15:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2021-11-20 06:15:24,658 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 23 [2021-11-20 06:15:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:24,660 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2021-11-20 06:15:24,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2021-11-20 06:15:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-20 06:15:24,663 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:24,663 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:15:24,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 06:15:24,664 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022436, now seen corresponding path program 1 times [2021-11-20 06:15:24,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:24,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561508133] [2021-11-20 06:15:24,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:24,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:15:24,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:24,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561508133] [2021-11-20 06:15:24,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561508133] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:15:24,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:15:24,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:15:24,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332176717] [2021-11-20 06:15:24,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:15:24,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:15:24,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:24,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:15:24,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:15:24,803 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:24,977 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2021-11-20 06:15:24,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:15:24,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-20 06:15:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:24,979 INFO L225 Difference]: With dead ends: 108 [2021-11-20 06:15:24,979 INFO L226 Difference]: Without dead ends: 108 [2021-11-20 06:15:24,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-20 06:15:24,980 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:24,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:15:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-20 06:15:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 67. [2021-11-20 06:15:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2021-11-20 06:15:24,983 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 23 [2021-11-20 06:15:24,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:24,984 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2021-11-20 06:15:24,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2021-11-20 06:15:24,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 06:15:24,984 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:24,985 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-11-20 06:15:24,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 06:15:24,985 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:24,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:24,985 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2021-11-20 06:15:24,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:24,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927578747] [2021-11-20 06:15:24,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:24,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:15:25,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:25,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927578747] [2021-11-20 06:15:25,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927578747] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:15:25,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:15:25,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 06:15:25,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645807745] [2021-11-20 06:15:25,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:15:25,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:15:25,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:25,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:15:25,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:15:25,030 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:25,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:25,045 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2021-11-20 06:15:25,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:15:25,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-20 06:15:25,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:25,047 INFO L225 Difference]: With dead ends: 85 [2021-11-20 06:15:25,047 INFO L226 Difference]: Without dead ends: 85 [2021-11-20 06:15:25,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-20 06:15:25,048 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 65 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:25,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 106 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:15:25,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-20 06:15:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2021-11-20 06:15:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2021-11-20 06:15:25,052 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 25 [2021-11-20 06:15:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:25,052 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2021-11-20 06:15:25,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2021-11-20 06:15:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 06:15:25,053 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:25,054 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-11-20 06:15:25,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-20 06:15:25,054 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:25,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:25,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1962551635, now seen corresponding path program 1 times [2021-11-20 06:15:25,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:25,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610221586] [2021-11-20 06:15:25,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:25,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:15:25,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:25,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610221586] [2021-11-20 06:15:25,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610221586] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:15:25,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:15:25,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:15:25,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683625358] [2021-11-20 06:15:25,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:15:25,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:15:25,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:25,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:15:25,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:15:25,114 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:25,264 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2021-11-20 06:15:25,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:15:25,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-20 06:15:25,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:25,266 INFO L225 Difference]: With dead ends: 87 [2021-11-20 06:15:25,266 INFO L226 Difference]: Without dead ends: 87 [2021-11-20 06:15:25,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-20 06:15:25,267 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 238 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:25,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 95 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:15:25,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-11-20 06:15:25,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2021-11-20 06:15:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-11-20 06:15:25,271 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 30 [2021-11-20 06:15:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:25,273 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-11-20 06:15:25,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-11-20 06:15:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 06:15:25,274 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:25,274 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-11-20 06:15:25,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-20 06:15:25,274 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:25,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:25,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1962551634, now seen corresponding path program 1 times [2021-11-20 06:15:25,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:25,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553326241] [2021-11-20 06:15:25,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:25,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:15:25,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:25,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553326241] [2021-11-20 06:15:25,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553326241] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:15:25,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:15:25,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:15:25,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068910665] [2021-11-20 06:15:25,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:15:25,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:15:25,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:25,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:15:25,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:15:25,387 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:25,535 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2021-11-20 06:15:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:15:25,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-20 06:15:25,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:25,536 INFO L225 Difference]: With dead ends: 94 [2021-11-20 06:15:25,536 INFO L226 Difference]: Without dead ends: 94 [2021-11-20 06:15:25,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-20 06:15:25,537 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 324 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:25,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 75 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:15:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-20 06:15:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2021-11-20 06:15:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2021-11-20 06:15:25,540 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 30 [2021-11-20 06:15:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:25,541 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2021-11-20 06:15:25,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2021-11-20 06:15:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 06:15:25,541 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:25,541 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] [2021-11-20 06:15:25,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-20 06:15:25,542 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:25,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:25,542 INFO L85 PathProgramCache]: Analyzing trace with hash -669697558, now seen corresponding path program 1 times [2021-11-20 06:15:25,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:25,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738835736] [2021-11-20 06:15:25,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:25,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:15:25,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:25,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738835736] [2021-11-20 06:15:25,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738835736] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:15:25,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859262491] [2021-11-20 06:15:25,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:25,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:15:25,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:15:25,624 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:15:25,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 06:15:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:25,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 06:15:25,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:15:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:15:25,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:15:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:15:25,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859262491] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:15:25,836 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:15:25,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2021-11-20 06:15:25,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769305707] [2021-11-20 06:15:25,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:15:25,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:15:25,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:25,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:15:25,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:15:25,838 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:25,898 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2021-11-20 06:15:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:15:25,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 06:15:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:25,900 INFO L225 Difference]: With dead ends: 136 [2021-11-20 06:15:25,901 INFO L226 Difference]: Without dead ends: 136 [2021-11-20 06:15:25,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:15:25,905 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 167 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:25,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 184 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:15:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-11-20 06:15:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 79. [2021-11-20 06:15:25,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.375) internal successors, (88), 78 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2021-11-20 06:15:25,909 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 31 [2021-11-20 06:15:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:25,910 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2021-11-20 06:15:25,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2021-11-20 06:15:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 06:15:25,911 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:25,911 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] [2021-11-20 06:15:25,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-20 06:15:26,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-20 06:15:26,133 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:26,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:26,134 INFO L85 PathProgramCache]: Analyzing trace with hash -669697613, now seen corresponding path program 1 times [2021-11-20 06:15:26,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:26,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571861535] [2021-11-20 06:15:26,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:26,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:15:26,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:26,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571861535] [2021-11-20 06:15:26,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571861535] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:15:26,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341931885] [2021-11-20 06:15:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:26,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:15:26,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:15:26,397 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:15:26,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-20 06:15:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:26,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-20 06:15:26,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:15:26,504 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-11-20 06:15:26,539 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:15:26,539 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-11-20 06:15:26,565 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 13 treesize of output 9 [2021-11-20 06:15:26,601 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-20 06:15:26,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 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:15:26,668 INFO L354 Elim1Store]: treesize reduction 80, result has 19.2 percent of original size [2021-11-20 06:15:26,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 43 [2021-11-20 06:15:27,050 INFO L354 Elim1Store]: treesize reduction 130, result has 17.7 percent of original size [2021-11-20 06:15:27,050 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 49 [2021-11-20 06:15:27,189 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-11-20 06:15:27,190 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 22 [2021-11-20 06:15:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:15:27,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:15:33,196 INFO L354 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2021-11-20 06:15:33,197 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 28 treesize of output 27 [2021-11-20 06:15:42,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) is different from false [2021-11-20 06:15:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-20 06:15:42,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341931885] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:15:42,858 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:15:42,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 31 [2021-11-20 06:15:42,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710829577] [2021-11-20 06:15:42,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:15:42,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-20 06:15:42,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:42,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-20 06:15:42,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=830, Unknown=13, NotChecked=58, Total=992 [2021-11-20 06:15:42,860 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:43,539 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2021-11-20 06:15:44,050 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) is different from false [2021-11-20 06:15:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:46,045 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2021-11-20 06:15:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 06:15:46,046 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 06:15:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:46,047 INFO L225 Difference]: With dead ends: 98 [2021-11-20 06:15:46,048 INFO L226 Difference]: Without dead ends: 98 [2021-11-20 06:15:46,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=186, Invalid=1371, Unknown=15, NotChecked=234, Total=1806 [2021-11-20 06:15:46,049 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 39 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:46,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 750 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 289 Invalid, 0 Unknown, 108 Unchecked, 0.2s Time] [2021-11-20 06:15:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-20 06:15:46,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2021-11-20 06:15:46,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 88 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2021-11-20 06:15:46,057 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 31 [2021-11-20 06:15:46,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:46,057 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2021-11-20 06:15:46,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:15:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2021-11-20 06:15:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 06:15:46,058 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:46,058 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] [2021-11-20 06:15:46,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-20 06:15:46,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-20 06:15:46,259 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:15:46,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash -669697612, now seen corresponding path program 1 times [2021-11-20 06:15:46,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:46,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043547540] [2021-11-20 06:15:46,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:46,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:15:46,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:46,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043547540] [2021-11-20 06:15:46,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043547540] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:15:46,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126901690] [2021-11-20 06:15:46,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:46,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:15:46,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:15:46,649 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:15:46,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-20 06:15:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:46,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-20 06:15:46,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:15:46,754 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-11-20 06:15:46,845 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:15:46,846 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-11-20 06:15:46,893 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 13 treesize of output 9 [2021-11-20 06:15:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-20 06:15:46,961 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-20 06:15:46,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:15:46,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:15:46,972 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 23 treesize of output 22 [2021-11-20 06:15:47,072 INFO L354 Elim1Store]: treesize reduction 104, result has 15.4 percent of original size [2021-11-20 06:15:47,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 94 [2021-11-20 06:15:47,096 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-11-20 06:15:47,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 90 [2021-11-20 06:15:47,646 INFO L354 Elim1Store]: treesize reduction 160, result has 17.5 percent of original size [2021-11-20 06:15:47,647 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 111 [2021-11-20 06:15:47,682 INFO L354 Elim1Store]: treesize reduction 150, result has 17.6 percent of original size [2021-11-20 06:15:47,683 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 96 [2021-11-20 06:15:47,896 INFO L354 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2021-11-20 06:15:47,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 72 [2021-11-20 06:15:47,907 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-11-20 06:15:47,908 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 29 [2021-11-20 06:15:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:15:47,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:15:49,067 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_2) .cse0))))) (forall ((v_DerPreprocessor_3 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) is different from false [2021-11-20 06:15:49,740 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_2) .cse0))))) (forall ((v_DerPreprocessor_3 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) is different from false [2021-11-20 06:15:51,779 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_DerPreprocessor_3 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_2) .cse0)))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) is different from false [2021-11-20 06:15:53,863 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_DerPreprocessor_3 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_2) .cse0)))))))) is different from false [2021-11-20 06:15:53,888 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:15:53,888 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 79 treesize of output 83 [2021-11-20 06:15:56,012 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_DerPreprocessor_3 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) .cse0))) (forall ((v_prenex_1 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_prenex_1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))))) is different from false [2021-11-20 06:15:58,118 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 Int)) (<= 0 (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_prenex_1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_DerPreprocessor_3 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (<= (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) .cse3)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) is different from false [2021-11-20 06:15:58,213 INFO L354 Elim1Store]: treesize reduction 99, result has 29.3 percent of original size [2021-11-20 06:15:58,213 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 3 case distinctions, treesize of input 163 treesize of output 163 [2021-11-20 06:15:58,284 INFO L354 Elim1Store]: treesize reduction 87, result has 37.9 percent of original size [2021-11-20 06:15:58,285 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 3 case distinctions, treesize of input 163 treesize of output 135 [2021-11-20 06:15:58,296 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:15:58,297 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 135 treesize of output 135 [2021-11-20 06:15:58,307 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:15:58,308 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 135 treesize of output 133 [2021-11-20 06:15:58,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 8 treesize of output 4 [2021-11-20 06:15:58,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 06:15:58,393 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:15:58,393 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 51 treesize of output 63 [2021-11-20 06:15:58,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 06:15:58,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 06:15:58,480 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 36 treesize of output 12 [2021-11-20 06:15:58,597 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-11-20 06:15:58,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 138 [2021-11-20 06:15:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-11-20 06:15:58,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126901690] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:15:58,901 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:15:58,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 41 [2021-11-20 06:15:58,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489954243] [2021-11-20 06:15:58,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:15:58,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-20 06:15:58,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:58,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-20 06:15:58,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1151, Unknown=6, NotChecked=438, Total=1722 [2021-11-20 06:15:58,904 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 42 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 42 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:01,131 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store .cse0 .cse2 0) .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (store .cse3 .cse2 0) .cse1) 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 Int)) (<= 0 (select (store (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_prenex_1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_DerPreprocessor_3 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (<= (select (store (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) .cse7)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select .cse3 .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) is different from false [2021-11-20 06:16:03,135 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_DerPreprocessor_3 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) .cse0))) (forall ((v_prenex_1 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_prenex_1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select .cse1 .cse2)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store .cse1 .cse3 0) .cse2)) (= (select .cse4 .cse3) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (store .cse4 .cse3 0) .cse2) 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (= (select .cse1 .cse3) 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select .cse4 .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) is different from false [2021-11-20 06:16:03,985 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_DerPreprocessor_3 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) .cse0))) (forall ((v_prenex_1 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_prenex_1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select .cse1 .cse2)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store .cse1 .cse3 0) .cse2)) (= (select .cse4 .cse3) 0) (= (select (store .cse4 .cse3 0) .cse2) 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select .cse1 .cse3) 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select .cse4 .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) is different from false [2021-11-20 06:16:04,615 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (select .cse7 .cse8)) (.cse0 (select .cse2 .cse8))) (let ((.cse5 (+ .cse0 8)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) (.cse6 (select |c_#length| .cse4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= .cse0 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_DerPreprocessor_3 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_2) .cse1)))))))) (= (select .cse2 .cse3) 0) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)) (= 12 .cse6) (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select .cse7 .cse3) 0) (<= 0 .cse0) (<= (+ .cse0 12) .cse6))))) is different from false [2021-11-20 06:16:05,259 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse4 (select .cse6 .cse7)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse0 (select .cse2 .cse7)) (.cse1 (+ 8 .cse4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)) (= (select |c_#length| (select .cse2 4)) 12) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_DerPreprocessor_3 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) .cse3) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_2) .cse3)))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (<= (+ 12 .cse4) (select |c_#length| .cse0)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0)) (= (select .cse2 .cse5) 0) (= (select .cse6 .cse5) 0) (<= 0 .cse4) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (= (select .cse6 4) 0))))) is different from false [2021-11-20 06:16:05,903 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse7 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse6 (select .cse0 .cse7)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 8)) (.cse1 (select .cse2 .cse7)) (.cse3 (+ .cse6 8))) (and (= (select .cse0 4) 0) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| .cse1)) (= 12 (select |c_#length| (select .cse2 4))) (= (select (select |c_#memory_$Pointer$.base| .cse1) .cse3) |c_ULTIMATE.start_dll_create_#res#1.base|) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) .cse4) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_2) .cse4))))) (forall ((v_DerPreprocessor_3 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (= (select .cse0 .cse5) 0) (<= (+ .cse6 12) (select |c_#length| .cse1)) (<= 0 .cse6) (= 0 (select .cse2 .cse5)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse3) |c_ULTIMATE.start_dll_create_#res#1.offset|))))) is different from false [2021-11-20 06:16:06,550 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse4 (select .cse1 .cse7)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) (.cse5 (select .cse3 .cse7)) (.cse6 (+ 8 .cse4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_2) .cse0))))) (forall ((v_DerPreprocessor_3 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_DerPreprocessor_3) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (= (select .cse1 .cse2) 0) (= (select |c_#length| (select .cse3 4)) 12) (<= 0 .cse4) (= 0 (select .cse1 4)) (not (= .cse5 |c_ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |c_ULTIMATE.start_main_~s~0#1.offset|) (<= (+ 12 .cse4) (select |c_#length| .cse5)) (= (select .cse3 .cse2) 0) (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))))) is different from false [2021-11-20 06:16:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:16:07,764 INFO L93 Difference]: Finished difference Result 266 states and 304 transitions. [2021-11-20 06:16:07,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 06:16:07,765 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 42 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 06:16:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:16:07,766 INFO L225 Difference]: With dead ends: 266 [2021-11-20 06:16:07,767 INFO L226 Difference]: Without dead ends: 266 [2021-11-20 06:16:07,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=249, Invalid=1770, Unknown=13, NotChecked=1274, Total=3306 [2021-11-20 06:16:07,770 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 879 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1140 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 06:16:07,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [879 Valid, 1188 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 755 Invalid, 0 Unknown, 1140 Unchecked, 0.6s Time] [2021-11-20 06:16:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-11-20 06:16:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 127. [2021-11-20 06:16:07,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 112 states have (on average 1.3571428571428572) internal successors, (152), 126 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2021-11-20 06:16:07,776 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 31 [2021-11-20 06:16:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:16:07,777 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2021-11-20 06:16:07,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 42 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2021-11-20 06:16:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-20 06:16:07,779 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:16:07,779 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-11-20 06:16:07,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-20 06:16:08,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-20 06:16:08,004 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:16:08,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:16:08,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1015753968, now seen corresponding path program 1 times [2021-11-20 06:16:08,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:16:08,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901608211] [2021-11-20 06:16:08,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:08,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:16:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-20 06:16:08,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:16:08,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901608211] [2021-11-20 06:16:08,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901608211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:16:08,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:16:08,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 06:16:08,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062762963] [2021-11-20 06:16:08,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:16:08,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:16:08,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:16:08,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:16:08,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:16:08,055 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:16:08,075 INFO L93 Difference]: Finished difference Result 151 states and 177 transitions. [2021-11-20 06:16:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:16:08,076 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-20 06:16:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:16:08,077 INFO L225 Difference]: With dead ends: 151 [2021-11-20 06:16:08,077 INFO L226 Difference]: Without dead ends: 151 [2021-11-20 06:16:08,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-20 06:16:08,078 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 161 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-11-20 06:16:08,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 161 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:16:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-11-20 06:16:08,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 128. [2021-11-20 06:16:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 127 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 153 transitions. [2021-11-20 06:16:08,087 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 153 transitions. Word has length 33 [2021-11-20 06:16:08,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:16:08,087 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 153 transitions. [2021-11-20 06:16:08,087 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2021-11-20 06:16:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-20 06:16:08,089 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:16:08,089 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] [2021-11-20 06:16:08,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-20 06:16:08,090 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:16:08,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:16:08,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1373031599, now seen corresponding path program 1 times [2021-11-20 06:16:08,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:16:08,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810292927] [2021-11-20 06:16:08,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:08,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:16:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:16:08,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:16:08,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810292927] [2021-11-20 06:16:08,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810292927] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:16:08,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369021470] [2021-11-20 06:16:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:08,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:16:08,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:16:08,163 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:16:08,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-20 06:16:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:08,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:16:08,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:16:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:16:08,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:16:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:16:08,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369021470] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:16:08,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:16:08,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-11-20 06:16:08,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123752949] [2021-11-20 06:16:08,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:16:08,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 06:16:08,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:16:08,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 06:16:08,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:16:08,436 INFO L87 Difference]: Start difference. First operand 128 states and 153 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:16:08,464 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2021-11-20 06:16:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:16:08,465 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-20 06:16:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:16:08,465 INFO L225 Difference]: With dead ends: 136 [2021-11-20 06:16:08,466 INFO L226 Difference]: Without dead ends: 136 [2021-11-20 06:16:08,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:16:08,467 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 126 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:16:08,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 160 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:16:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-11-20 06:16:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2021-11-20 06:16:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 133 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2021-11-20 06:16:08,471 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 34 [2021-11-20 06:16:08,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:16:08,472 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2021-11-20 06:16:08,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2021-11-20 06:16:08,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-20 06:16:08,473 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:16:08,473 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:16:08,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-20 06:16:08,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:16:08,680 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:16:08,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:16:08,680 INFO L85 PathProgramCache]: Analyzing trace with hash -833185592, now seen corresponding path program 2 times [2021-11-20 06:16:08,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:16:08,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248719495] [2021-11-20 06:16:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:08,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:16:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-20 06:16:08,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:16:08,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248719495] [2021-11-20 06:16:08,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248719495] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:16:08,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044364944] [2021-11-20 06:16:08,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:16:08,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:16:08,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:16:08,744 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:16:08,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-20 06:16:08,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:16:08,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:16:08,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 06:16:08,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:16:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-20 06:16:08,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:16:08,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044364944] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:16:08,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:16:08,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-11-20 06:16:08,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894589031] [2021-11-20 06:16:08,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:16:08,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:16:08,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:16:08,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:16:08,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:16:08,916 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:16:08,937 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2021-11-20 06:16:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:16:08,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-20 06:16:08,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:16:08,939 INFO L225 Difference]: With dead ends: 104 [2021-11-20 06:16:08,939 INFO L226 Difference]: Without dead ends: 104 [2021-11-20 06:16:08,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:16:08,940 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 100 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 74 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-11-20 06:16:08,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 74 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:16:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-11-20 06:16:08,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-11-20 06:16:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.348314606741573) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2021-11-20 06:16:08,944 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 39 [2021-11-20 06:16:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:16:08,944 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2021-11-20 06:16:08,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:08,945 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2021-11-20 06:16:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-20 06:16:08,945 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:16:08,945 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] [2021-11-20 06:16:08,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-20 06:16:09,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:16:09,169 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:16:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:16:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1013618178, now seen corresponding path program 2 times [2021-11-20 06:16:09,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:16:09,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287484639] [2021-11-20 06:16:09,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:09,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:16:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 06:16:09,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:16:09,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287484639] [2021-11-20 06:16:09,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287484639] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:16:09,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017032674] [2021-11-20 06:16:09,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:16:09,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:16:09,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:16:09,245 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:16:09,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-20 06:16:09,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:16:09,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:16:09,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:16:09,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:16:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 06:16:09,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:16:09,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017032674] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:16:09,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:16:09,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-11-20 06:16:09,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552765245] [2021-11-20 06:16:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:16:09,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:16:09,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:16:09,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:16:09,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:16:09,481 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:16:09,505 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2021-11-20 06:16:09,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:16:09,506 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-20 06:16:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:16:09,506 INFO L225 Difference]: With dead ends: 82 [2021-11-20 06:16:09,506 INFO L226 Difference]: Without dead ends: 82 [2021-11-20 06:16:09,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:16:09,507 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 77 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:16:09,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 114 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:16:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-11-20 06:16:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2021-11-20 06:16:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2021-11-20 06:16:09,510 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 39 [2021-11-20 06:16:09,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:16:09,510 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2021-11-20 06:16:09,511 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:09,511 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2021-11-20 06:16:09,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-20 06:16:09,511 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:16:09,511 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] [2021-11-20 06:16:09,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-20 06:16:09,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-20 06:16:09,728 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:16:09,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:16:09,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1273435421, now seen corresponding path program 2 times [2021-11-20 06:16:09,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:16:09,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492736949] [2021-11-20 06:16:09,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:09,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:16:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:16:09,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:16:09,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492736949] [2021-11-20 06:16:09,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492736949] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:16:09,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271248436] [2021-11-20 06:16:09,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:16:09,801 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:16:09,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:16:09,805 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:16:09,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-20 06:16:09,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:16:09,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:16:09,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:16:09,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:16:09,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:16:09,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:16:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:16:10,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271248436] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:16:10,038 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:16:10,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2021-11-20 06:16:10,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945682861] [2021-11-20 06:16:10,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:16:10,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:16:10,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:16:10,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:16:10,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:16:10,039 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:16:10,084 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2021-11-20 06:16:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:16:10,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-20 06:16:10,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:16:10,088 INFO L225 Difference]: With dead ends: 78 [2021-11-20 06:16:10,088 INFO L226 Difference]: Without dead ends: 78 [2021-11-20 06:16:10,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:16:10,090 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 78 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:16:10,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 232 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:16:10,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-20 06:16:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2021-11-20 06:16:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2021-11-20 06:16:10,094 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 39 [2021-11-20 06:16:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:16:10,095 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2021-11-20 06:16:10,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2021-11-20 06:16:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-20 06:16:10,096 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:16:10,096 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-11-20 06:16:10,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-20 06:16:10,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:16:10,296 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:16:10,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:16:10,297 INFO L85 PathProgramCache]: Analyzing trace with hash 993974679, now seen corresponding path program 1 times [2021-11-20 06:16:10,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:16:10,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110748648] [2021-11-20 06:16:10,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:10,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:16:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:16:10,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:16:10,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110748648] [2021-11-20 06:16:10,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110748648] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:16:10,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489088689] [2021-11-20 06:16:10,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:10,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:16:10,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:16:10,814 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:16:10,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-20 06:16:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:10,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 75 conjunts are in the unsatisfiable core [2021-11-20 06:16:10,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:16:10,905 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-11-20 06:16:11,010 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:16:11,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-20 06:16:11,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-20 06:16:11,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:16:11,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:16:11,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:16:11,232 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-11-20 06:16:11,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 38 [2021-11-20 06:16:11,667 INFO L354 Elim1Store]: treesize reduction 63, result has 12.5 percent of original size [2021-11-20 06:16:11,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 37 [2021-11-20 06:16:11,683 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-11-20 06:16:11,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 06:16:11,942 INFO L354 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2021-11-20 06:16:11,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 17 [2021-11-20 06:16:12,071 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 06:16:12,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:16:12,269 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-11-20 06:16:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:16:12,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:16:13,483 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_update_at_~head#1.offset| Int) (|ULTIMATE.start_dll_update_at_~data#1| Int)) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| |ULTIMATE.start_dll_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|ULTIMATE.start_dll_update_at_~head#1.offset| Int) (|ULTIMATE.start_dll_update_at_~data#1| Int)) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| |ULTIMATE.start_dll_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-11-20 06:16:14,547 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_update_at_~head#1.offset| Int) (|ULTIMATE.start_dll_update_at_~data#1| Int)) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| |ULTIMATE.start_dll_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((|ULTIMATE.start_dll_update_at_~head#1.offset| Int) (|ULTIMATE.start_dll_update_at_~data#1| Int)) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| |ULTIMATE.start_dll_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2021-11-20 06:16:24,747 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 406 treesize of output 390 [2021-11-20 06:16:25,780 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_DerPreprocessor_4) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2021-11-20 06:16:25,877 INFO L354 Elim1Store]: treesize reduction 104, result has 25.7 percent of original size [2021-11-20 06:16:25,877 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 3 case distinctions, treesize of input 53 treesize of output 49 [2021-11-20 06:16:25,890 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:16:25,890 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 49 treesize of output 45 [2021-11-20 06:16:25,901 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 06:16:25,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 48 [2021-11-20 06:16:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-20 06:16:26,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489088689] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:16:26,591 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:16:26,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 59 [2021-11-20 06:16:26,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825196167] [2021-11-20 06:16:26,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:16:26,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-11-20 06:16:26,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:16:26,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-11-20 06:16:26,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2854, Unknown=9, NotChecked=330, Total=3422 [2021-11-20 06:16:26,594 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 59 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 59 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:16:27,512 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2021-11-20 06:16:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-20 06:16:27,513 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 59 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-20 06:16:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:16:27,514 INFO L225 Difference]: With dead ends: 76 [2021-11-20 06:16:27,514 INFO L226 Difference]: Without dead ends: 76 [2021-11-20 06:16:27,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1637 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=474, Invalid=4641, Unknown=9, NotChecked=426, Total=5550 [2021-11-20 06:16:27,516 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 93 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:16:27,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 787 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 378 Invalid, 0 Unknown, 381 Unchecked, 0.2s Time] [2021-11-20 06:16:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-11-20 06:16:27,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-11-20 06:16:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2) internal successors, (78), 75 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2021-11-20 06:16:27,519 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 42 [2021-11-20 06:16:27,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:16:27,519 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2021-11-20 06:16:27,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 59 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:16:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2021-11-20 06:16:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-20 06:16:27,520 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:16:27,520 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] [2021-11-20 06:16:27,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-20 06:16:27,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:16:27,732 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:16:27,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:16:27,732 INFO L85 PathProgramCache]: Analyzing trace with hash 594303695, now seen corresponding path program 1 times [2021-11-20 06:16:27,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:16:27,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856502633] [2021-11-20 06:16:27,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:27,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:16:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:16:28,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:16:28,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856502633] [2021-11-20 06:16:28,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856502633] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:16:28,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820254196] [2021-11-20 06:16:28,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:28,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:16:28,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:16:28,410 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:16:28,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-20 06:16:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:28,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 55 conjunts are in the unsatisfiable core [2021-11-20 06:16:28,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:16:28,489 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-11-20 06:16:28,549 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:16:28,550 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-11-20 06:16:28,591 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 13 treesize of output 9 [2021-11-20 06:16:28,653 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-20 06:16:28,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:16:28,716 INFO L354 Elim1Store]: treesize reduction 80, result has 19.2 percent of original size [2021-11-20 06:16:28,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 38 [2021-11-20 06:16:29,067 INFO L354 Elim1Store]: treesize reduction 130, result has 17.7 percent of original size [2021-11-20 06:16:29,067 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2021-11-20 06:16:29,398 INFO L354 Elim1Store]: treesize reduction 132, result has 20.5 percent of original size [2021-11-20 06:16:29,399 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 63 [2021-11-20 06:16:29,620 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 06:16:29,620 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 40 treesize of output 16 [2021-11-20 06:16:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:16:29,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:16:29,759 INFO L354 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2021-11-20 06:16:29,759 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 26 treesize of output 25 [2021-11-20 06:16:30,489 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_update_at_~head#1.offset| Int) (v_DerPreprocessor_5 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| v_DerPreprocessor_5)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) is different from false [2021-11-20 06:16:56,540 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_5 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_6)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse2 .cse3))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_DerPreprocessor_5))) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) .cse1))))) is different from false [2021-11-20 06:16:58,569 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_5 Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_6)) (.cse3 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse2 .cse3))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3) .cse1))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))) is different from false [2021-11-20 06:17:00,596 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_5 Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_6)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse2 .cse3))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3) .cse1))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))) is different from false [2021-11-20 06:17:02,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_5 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_6)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2))) (store .cse1 .cse0 (store (select .cse1 .cse0) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)))))) is different from false [2021-11-20 06:17:04,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_5 Int) (|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_6)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse3 .cse4))) (= .cse0 (select (select (let ((.cse1 (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3))) (store .cse1 .cse0 (store (select .cse1 .cse0) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))) is different from false [2021-11-20 06:17:06,684 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_5 Int) (|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (or (let ((.cse2 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_6)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse3 .cse4))) (= .cse0 (select (select (let ((.cse1 (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3))) (store .cse1 .cse0 (store (select .cse1 .cse0) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))) is different from false [2021-11-20 06:17:06,744 INFO L354 Elim1Store]: treesize reduction 104, result has 25.7 percent of original size [2021-11-20 06:17:06,744 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 3 case distinctions, treesize of input 6213 treesize of output 2248 [2021-11-20 06:17:06,770 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:17:06,771 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 2248 treesize of output 2046 [2021-11-20 06:17:06,816 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 06:17:06,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3396 treesize of output 2992 [2021-11-20 06:17:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2021-11-20 06:17:08,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820254196] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:17:08,175 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:17:08,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18, 19] total 55 [2021-11-20 06:17:08,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827928711] [2021-11-20 06:17:08,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:17:08,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-11-20 06:17:08,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:17:08,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-11-20 06:17:08,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2188, Unknown=37, NotChecked=700, Total=3080 [2021-11-20 06:17:08,178 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 56 states, 55 states have (on average 2.4) internal successors, (132), 56 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:10,410 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_5 Int) (|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (or (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_6)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse4 .cse5))) (= .cse1 (select (select (let ((.cse2 (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4))) (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))) (= (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0) .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from false [2021-11-20 06:17:11,926 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 0) .cse1) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_5 Int) (|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (or (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_6)) (.cse7 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select .cse6 .cse7))) (= .cse3 (select (select (let ((.cse4 (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6))) (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select .cse0 .cse2) 0))) is different from false [2021-11-20 06:17:13,929 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 0) .cse1) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_5 Int) (|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (or (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_6)) (.cse7 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select .cse6 .cse7))) (= .cse3 (select (select (let ((.cse4 (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6))) (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))) (= (select .cse0 .cse2) 0))) is different from false [2021-11-20 06:17:15,935 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= (select .cse1 .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_5 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_6)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select .cse4 .cse5))) (= .cse2 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4))) (store .cse3 .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)))))))) is different from false [2021-11-20 06:17:17,941 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_5 Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_6)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse2 .cse3))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3) .cse1))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select .cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= (select .cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) is different from false [2021-11-20 06:17:19,946 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_5 Int)) (or (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_6)) (.cse4 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse2 (select .cse3 .cse4))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse3))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse4) .cse2))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))) (= 0 (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 8))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_ULTIMATE.start_dll_create_#res#1.offset|) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2021-11-20 06:17:21,951 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_5 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_6)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select .cse3 .cse4))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_DerPreprocessor_5))) |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) .cse2))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= (select (select |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| 4))) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_main_~s~0#1.base|)) (= (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-11-20 06:17:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:22,790 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2021-11-20 06:17:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-20 06:17:22,790 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.4) internal successors, (132), 56 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-20 06:17:22,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:17:22,791 INFO L225 Difference]: With dead ends: 118 [2021-11-20 06:17:22,791 INFO L226 Difference]: Without dead ends: 118 [2021-11-20 06:17:22,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 52.2s TimeCoverageRelationStatistics Valid=326, Invalid=3592, Unknown=44, NotChecked=1890, Total=5852 [2021-11-20 06:17:22,794 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 476 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 777 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:17:22,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [476 Valid, 885 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 600 Invalid, 0 Unknown, 777 Unchecked, 0.4s Time] [2021-11-20 06:17:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-20 06:17:22,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2021-11-20 06:17:22,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2021-11-20 06:17:22,797 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 48 [2021-11-20 06:17:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:17:22,798 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2021-11-20 06:17:22,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.4) internal successors, (132), 56 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2021-11-20 06:17:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-20 06:17:22,799 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:17:22,799 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] [2021-11-20 06:17:22,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-11-20 06:17:23,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-20 06:17:23,016 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:17:23,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash 594303696, now seen corresponding path program 1 times [2021-11-20 06:17:23,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:23,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030506366] [2021-11-20 06:17:23,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:23,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:17:23,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:17:23,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030506366] [2021-11-20 06:17:23,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030506366] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:17:23,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018729543] [2021-11-20 06:17:23,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:23,726 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:17:23,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:23,727 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:17:23,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-20 06:17:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:23,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 64 conjunts are in the unsatisfiable core [2021-11-20 06:17:23,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:23,823 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-11-20 06:17:23,901 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:17:23,901 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-11-20 06:17:23,941 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 13 treesize of output 9 [2021-11-20 06:17:23,980 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-20 06:17:23,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:17:24,087 INFO L354 Elim1Store]: treesize reduction 80, result has 19.2 percent of original size [2021-11-20 06:17:24,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 38 [2021-11-20 06:17:24,416 INFO L354 Elim1Store]: treesize reduction 130, result has 17.7 percent of original size [2021-11-20 06:17:24,417 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2021-11-20 06:17:24,772 INFO L354 Elim1Store]: treesize reduction 180, result has 18.2 percent of original size [2021-11-20 06:17:24,773 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 125 [2021-11-20 06:17:24,786 INFO L354 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2021-11-20 06:17:24,786 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 120 treesize of output 92 [2021-11-20 06:17:25,082 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 06:17:25,082 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 66 treesize of output 42 [2021-11-20 06:17:25,085 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 36 treesize of output 18 [2021-11-20 06:17:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:17:25,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:25,373 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:17:25,374 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 61 treesize of output 65 [2021-11-20 06:17:25,648 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:17:25,648 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 180 treesize of output 135 [2021-11-20 06:17:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:17:28,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018729543] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:17:28,897 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:17:28,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2021-11-20 06:17:28,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807023985] [2021-11-20 06:17:28,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:17:28,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-11-20 06:17:28,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:17:28,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-11-20 06:17:28,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2275, Unknown=2, NotChecked=0, Total=2450 [2021-11-20 06:17:28,899 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 50 states, 49 states have (on average 2.7551020408163267) internal successors, (135), 50 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:30,468 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2021-11-20 06:17:30,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 06:17:30,468 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.7551020408163267) internal successors, (135), 50 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-20 06:17:30,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:17:30,469 INFO L225 Difference]: With dead ends: 125 [2021-11-20 06:17:30,469 INFO L226 Difference]: Without dead ends: 125 [2021-11-20 06:17:30,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=396, Invalid=4024, Unknown=2, NotChecked=0, Total=4422 [2021-11-20 06:17:30,471 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 494 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:17:30,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 1281 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 521 Invalid, 0 Unknown, 258 Unchecked, 0.3s Time] [2021-11-20 06:17:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-20 06:17:30,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 79. [2021-11-20 06:17:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2021-11-20 06:17:30,475 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 48 [2021-11-20 06:17:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:17:30,475 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2021-11-20 06:17:30,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.7551020408163267) internal successors, (135), 50 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2021-11-20 06:17:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-20 06:17:30,476 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:17:30,476 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] [2021-11-20 06:17:30,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:30,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-20 06:17:30,688 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:17:30,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:30,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1192975024, now seen corresponding path program 1 times [2021-11-20 06:17:30,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:30,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227856328] [2021-11-20 06:17:30,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:30,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 06:17:30,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:17:30,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227856328] [2021-11-20 06:17:30,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227856328] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:17:30,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140547516] [2021-11-20 06:17:30,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:30,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:17:30,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:30,760 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:17:30,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-20 06:17:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:30,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:17:30,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 06:17:30,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 06:17:31,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140547516] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:17:31,030 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:17:31,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2021-11-20 06:17:31,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282163523] [2021-11-20 06:17:31,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:17:31,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:17:31,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:17:31,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:17:31,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:17:31,032 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:31,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:31,079 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2021-11-20 06:17:31,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:17:31,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-20 06:17:31,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:17:31,080 INFO L225 Difference]: With dead ends: 79 [2021-11-20 06:17:31,080 INFO L226 Difference]: Without dead ends: 79 [2021-11-20 06:17:31,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:17:31,081 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 84 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:17:31,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 160 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:17:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-20 06:17:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-11-20 06:17:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 78 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2021-11-20 06:17:31,084 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 49 [2021-11-20 06:17:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:17:31,084 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2021-11-20 06:17:31,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2021-11-20 06:17:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-20 06:17:31,084 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:17:31,084 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] [2021-11-20 06:17:31,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:31,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-20 06:17:31,295 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:17:31,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1047895438, now seen corresponding path program 2 times [2021-11-20 06:17:31,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:31,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962882815] [2021-11-20 06:17:31,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:31,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 06:17:31,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:17:31,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962882815] [2021-11-20 06:17:31,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962882815] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:17:31,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726600680] [2021-11-20 06:17:31,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:17:31,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:17:31,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:31,347 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:17:31,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-20 06:17:31,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:17:31,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:17:31,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 06:17:31,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-20 06:17:31,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-20 06:17:31,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726600680] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:17:31,714 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:17:31,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-11-20 06:17:31,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473975213] [2021-11-20 06:17:31,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:17:31,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:17:31,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:17:31,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:17:31,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:17:31,715 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:31,788 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2021-11-20 06:17:31,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:17:31,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-20 06:17:31,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:17:31,789 INFO L225 Difference]: With dead ends: 70 [2021-11-20 06:17:31,789 INFO L226 Difference]: Without dead ends: 70 [2021-11-20 06:17:31,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:17:31,789 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 106 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:17:31,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 106 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:17:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-20 06:17:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-11-20 06:17:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 69 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2021-11-20 06:17:31,792 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 51 [2021-11-20 06:17:31,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:17:31,792 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2021-11-20 06:17:31,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:17:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2021-11-20 06:17:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-20 06:17:31,793 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:17:31,793 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] [2021-11-20 06:17:31,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:31,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:17:31,994 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:17:31,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:31,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1925550127, now seen corresponding path program 1 times [2021-11-20 06:17:31,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:17:31,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220242680] [2021-11-20 06:17:31,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:31,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:17:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:17:32,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:17:32,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220242680] [2021-11-20 06:17:32,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220242680] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:17:32,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581473735] [2021-11-20 06:17:32,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:32,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:17:32,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:17:32,984 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:17:32,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-20 06:17:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:33,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 85 conjunts are in the unsatisfiable core [2021-11-20 06:17:33,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:33,056 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-11-20 06:17:33,137 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:17:33,138 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-11-20 06:17:33,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-20 06:17:33,238 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-20 06:17:33,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:17:33,313 INFO L354 Elim1Store]: treesize reduction 80, result has 19.2 percent of original size [2021-11-20 06:17:33,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 38 [2021-11-20 06:17:33,753 INFO L354 Elim1Store]: treesize reduction 130, result has 17.7 percent of original size [2021-11-20 06:17:33,753 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2021-11-20 06:17:34,221 INFO L354 Elim1Store]: treesize reduction 180, result has 18.2 percent of original size [2021-11-20 06:17:34,221 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 122 [2021-11-20 06:17:34,224 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 123 treesize of output 113 [2021-11-20 06:17:34,235 INFO L354 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2021-11-20 06:17:34,235 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 113 treesize of output 91 [2021-11-20 06:17:34,675 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 06:17:34,675 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 57 treesize of output 33 [2021-11-20 06:17:34,678 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-11-20 06:17:34,742 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-11-20 06:17:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:17:34,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:35,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 170 treesize of output 138 [2021-11-20 06:17:35,783 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:17:35,784 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 70 treesize of output 55 [2021-11-20 06:17:35,825 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 41 treesize of output 35 [2021-11-20 06:17:36,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_37| Int)) (or (and (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_DerPreprocessor_12 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_37| v_DerPreprocessor_12) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_37|))) is different from false [2021-11-20 06:17:37,301 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_37| Int)) (or (forall ((v_DerPreprocessor_12 Int)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_37| v_DerPreprocessor_12) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_37|))) is different from false [2021-11-20 06:17:37,849 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_37| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_37| v_DerPreprocessor_12) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_37|))) is different from false [2021-11-20 06:17:38,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_37|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_37| v_DerPreprocessor_12) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))) is different from false [2021-11-20 06:18:09,412 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_37| Int) (|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_37|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_37| v_DerPreprocessor_12) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))) is different from false [2021-11-20 06:18:09,459 INFO L354 Elim1Store]: treesize reduction 104, result has 25.7 percent of original size [2021-11-20 06:18:09,460 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 3 case distinctions, treesize of input 57 treesize of output 52 [2021-11-20 06:18:09,468 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:18:09,468 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 52 treesize of output 48 [2021-11-20 06:18:09,483 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 06:18:09,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 51 [2021-11-20 06:18:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-11-20 06:18:09,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581473735] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:18:09,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:18:09,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 26] total 66 [2021-11-20 06:18:09,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984814856] [2021-11-20 06:18:09,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:18:09,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-11-20 06:18:09,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:18:09,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-11-20 06:18:09,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3467, Unknown=34, NotChecked=610, Total=4290 [2021-11-20 06:18:09,631 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 66 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:10,747 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse3 .cse2)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0) .cse2) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (forall ((v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_37|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_37| v_DerPreprocessor_12) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select .cse3 .cse1) 0)))) is different from false [2021-11-20 06:18:11,339 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0) (forall ((v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_37| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_37| v_DerPreprocessor_12) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_37|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_35| Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_35| 8)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) is different from false [2021-11-20 06:18:11,928 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0) (forall ((v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_37| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_37| v_DerPreprocessor_12) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_37|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_35| Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_35| 8)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) is different from false [2021-11-20 06:18:12,519 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_37| Int)) (or (forall ((v_DerPreprocessor_12 Int)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_37| v_DerPreprocessor_12) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_37|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_35| Int)) (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_35| 8)))) (= 0 (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 8))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_ULTIMATE.start_dll_create_#res#1.offset|) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2021-11-20 06:18:13,109 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_35| Int)) (= (select (select |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| 4))) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_35| 8)) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_37| Int)) (or (and (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_DerPreprocessor_12 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_37| v_DerPreprocessor_12) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_37|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-11-20 06:18:16,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:18:16,683 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2021-11-20 06:18:16,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-20 06:18:16,683 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 66 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-20 06:18:16,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:18:16,684 INFO L225 Difference]: With dead ends: 68 [2021-11-20 06:18:16,684 INFO L226 Difference]: Without dead ends: 68 [2021-11-20 06:18:16,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=400, Invalid=6079, Unknown=41, NotChecked=1670, Total=8190 [2021-11-20 06:18:16,686 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 162 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 560 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 06:18:16,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 1079 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 785 Invalid, 0 Unknown, 560 Unchecked, 0.5s Time] [2021-11-20 06:18:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-20 06:18:16,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-11-20 06:18:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.096774193548387) internal successors, (68), 67 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2021-11-20 06:18:16,689 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 52 [2021-11-20 06:18:16,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:18:16,690 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2021-11-20 06:18:16,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 66 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:16,690 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2021-11-20 06:18:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-20 06:18:16,691 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:18:16,691 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] [2021-11-20 06:18:16,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-20 06:18:16,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:18:16,912 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:18:16,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:18:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317609, now seen corresponding path program 1 times [2021-11-20 06:18:16,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:18:16,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186409485] [2021-11-20 06:18:16,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:18:16,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:18:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:18:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-20 06:18:17,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:18:17,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186409485] [2021-11-20 06:18:17,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186409485] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:18:17,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:18:17,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:18:17,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303486609] [2021-11-20 06:18:17,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:18:17,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:18:17,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:18:17,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:18:17,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:18:17,016 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:18:17,181 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2021-11-20 06:18:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:18:17,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-20 06:18:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:18:17,182 INFO L225 Difference]: With dead ends: 79 [2021-11-20 06:18:17,182 INFO L226 Difference]: Without dead ends: 79 [2021-11-20 06:18:17,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-20 06:18:17,183 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 141 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:18:17,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 75 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:18:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-20 06:18:17,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2021-11-20 06:18:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.109375) internal successors, (71), 68 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2021-11-20 06:18:17,186 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 56 [2021-11-20 06:18:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:18:17,186 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2021-11-20 06:18:17,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2021-11-20 06:18:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-20 06:18:17,187 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:18:17,187 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] [2021-11-20 06:18:17,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-20 06:18:17,187 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:18:17,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:18:17,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317608, now seen corresponding path program 1 times [2021-11-20 06:18:17,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:18:17,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605692716] [2021-11-20 06:18:17,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:18:17,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:18:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:18:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-20 06:18:17,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:18:17,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605692716] [2021-11-20 06:18:17,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605692716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:18:17,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:18:17,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:18:17,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620491820] [2021-11-20 06:18:17,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:18:17,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:18:17,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:18:17,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:18:17,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:18:17,288 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:18:17,468 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2021-11-20 06:18:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:18:17,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-20 06:18:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:18:17,469 INFO L225 Difference]: With dead ends: 77 [2021-11-20 06:18:17,469 INFO L226 Difference]: Without dead ends: 77 [2021-11-20 06:18:17,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-20 06:18:17,470 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 177 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:18:17,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 50 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:18:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-20 06:18:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2021-11-20 06:18:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:17,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2021-11-20 06:18:17,472 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 56 [2021-11-20 06:18:17,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:18:17,472 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2021-11-20 06:18:17,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:17,473 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2021-11-20 06:18:17,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-20 06:18:17,473 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:18:17,473 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] [2021-11-20 06:18:17,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-20 06:18:17,474 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:18:17,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:18:17,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1291305133, now seen corresponding path program 1 times [2021-11-20 06:18:17,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:18:17,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106414568] [2021-11-20 06:18:17,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:18:17,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:18:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:18:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-20 06:18:17,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:18:17,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106414568] [2021-11-20 06:18:17,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106414568] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:18:17,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:18:17,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 06:18:17,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437072689] [2021-11-20 06:18:17,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:18:17,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:18:17,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:18:17,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:18:17,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:18:17,554 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:18:17,674 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2021-11-20 06:18:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:18:17,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-20 06:18:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:18:17,676 INFO L225 Difference]: With dead ends: 74 [2021-11-20 06:18:17,676 INFO L226 Difference]: Without dead ends: 74 [2021-11-20 06:18:17,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-20 06:18:17,676 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 164 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:18:17,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 76 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:18:17,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-20 06:18:17,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2021-11-20 06:18:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 70 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2021-11-20 06:18:17,679 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 57 [2021-11-20 06:18:17,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:18:17,679 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2021-11-20 06:18:17,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2021-11-20 06:18:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-20 06:18:17,680 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:18:17,680 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] [2021-11-20 06:18:17,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-20 06:18:17,681 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:18:17,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:18:17,681 INFO L85 PathProgramCache]: Analyzing trace with hash 302765524, now seen corresponding path program 1 times [2021-11-20 06:18:17,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:18:17,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992829624] [2021-11-20 06:18:17,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:18:17,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:18:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:18:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-20 06:18:17,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:18:17,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992829624] [2021-11-20 06:18:17,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992829624] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:18:17,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:18:17,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:18:17,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489748229] [2021-11-20 06:18:17,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:18:17,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:18:17,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:18:17,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:18:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:18:17,757 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:18:17,895 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2021-11-20 06:18:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:18:17,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-20 06:18:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:18:17,896 INFO L225 Difference]: With dead ends: 72 [2021-11-20 06:18:17,896 INFO L226 Difference]: Without dead ends: 72 [2021-11-20 06:18:17,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-20 06:18:17,897 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 150 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:18:17,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 63 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:18:17,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-20 06:18:17,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-11-20 06:18:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 71 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2021-11-20 06:18:17,899 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2021-11-20 06:18:17,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:18:17,900 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2021-11-20 06:18:17,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:18:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2021-11-20 06:18:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-20 06:18:17,900 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:18:17,900 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] [2021-11-20 06:18:17,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-20 06:18:17,901 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:18:17,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:18:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash 256575356, now seen corresponding path program 1 times [2021-11-20 06:18:17,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:18:17,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255658748] [2021-11-20 06:18:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:18:17,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:18:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:18:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-20 06:18:18,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:18:18,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255658748] [2021-11-20 06:18:18,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255658748] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:18:18,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197143485] [2021-11-20 06:18:18,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:18:18,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:18:18,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:18:18,490 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:18:18,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-20 06:18:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:18:18,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-20 06:18:18,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:18:18,602 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-11-20 06:18:18,652 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:18:18,653 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-11-20 06:18:18,672 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 13 treesize of output 9 [2021-11-20 06:18:18,702 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 0 case distinctions, treesize of input 43 treesize of output 36 [2021-11-20 06:18:18,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:18:18,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:18:18,706 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 26 treesize of output 26 [2021-11-20 06:18:18,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:18:18,779 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-11-20 06:18:18,779 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 3 case distinctions, treesize of input 56 treesize of output 43 [2021-11-20 06:18:19,158 INFO L354 Elim1Store]: treesize reduction 102, result has 19.0 percent of original size [2021-11-20 06:18:19,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 45 [2021-11-20 06:18:19,451 INFO L354 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2021-11-20 06:18:19,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 59 [2021-11-20 06:18:19,765 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:18:19,765 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 3 case distinctions, treesize of input 34 treesize of output 36 [2021-11-20 06:18:19,940 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:18:19,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2021-11-20 06:18:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 06:18:19,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:18:21,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 Int) (|ULTIMATE.start_dll_update_at_~head#1.offset| Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| v_DerPreprocessor_13)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) is different from false [2021-11-20 06:18:21,937 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 Int) (|ULTIMATE.start_dll_update_at_~head#1.offset| Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| v_DerPreprocessor_13)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) is different from false [2021-11-20 06:18:34,792 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_DerPreprocessor_13))) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) is different from false [2021-11-20 06:18:36,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_DerPreprocessor_14)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_DerPreprocessor_13)))) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) is different from false [2021-11-20 06:18:38,452 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_41| Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_41| v_DerPreprocessor_14))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_DerPreprocessor_13)))) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_41|))) is different from false [2021-11-20 06:18:40,472 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_41| Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base| 0) (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_41| v_DerPreprocessor_14))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse2)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_DerPreprocessor_13)))) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) 1) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_41|))) is different from false [2021-11-20 06:18:42,492 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_41| Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_41|) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_41| v_DerPreprocessor_14))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_DerPreprocessor_13)))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1))) is different from false [2021-11-20 06:18:44,351 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_41| Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_41|) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_41| v_DerPreprocessor_14))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_DerPreprocessor_13)))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 1))) is different from false [2021-11-20 06:18:44,368 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:18:44,369 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 232 treesize of output 236 [2021-11-20 06:18:46,426 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_41| Int)) (or (and (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int) (|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (let ((.cse2 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_41| v_DerPreprocessor_14))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_DerPreprocessor_13))))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int) (|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (let ((.cse6 (store (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_41| v_DerPreprocessor_14))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6)) (.cse5 (select .cse6 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_DerPreprocessor_13))))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_41|))) is different from false [2021-11-20 06:18:48,519 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_41| Int)) (or (and (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int) (|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse2 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_41| v_DerPreprocessor_14))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_DerPreprocessor_13))))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int) (|ULTIMATE.start_dll_create_~head~0#1.offset| Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse7 (store (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_41| v_DerPreprocessor_14))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7)) (.cse6 (select .cse7 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_DerPreprocessor_13))))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_41|))) is different from false [2021-11-20 06:18:48,806 INFO L354 Elim1Store]: treesize reduction 348, result has 28.8 percent of original size [2021-11-20 06:18:48,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 289670 treesize of output 190530 [2021-11-20 06:18:56,891 WARN L227 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 1225 DAG size of output: 1225 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:18:56,971 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:18:56,977 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 182626 treesize of output 180586 [2021-11-20 06:18:58,081 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:18:58,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 180586 treesize of output 177758 [2021-11-20 06:18:59,289 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-20 06:18:59,289 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:18:59,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-11-20 06:18:59,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992148446] [2021-11-20 06:18:59,289 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-20 06:18:59,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 06:18:59,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:18:59,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 06:18:59,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1507, Unknown=21, NotChecked=870, Total=2550 [2021-11-20 06:18:59,291 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:19:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:19:00,471 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2021-11-20 06:19:00,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 06:19:00,472 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-20 06:19:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:19:00,473 INFO L225 Difference]: With dead ends: 79 [2021-11-20 06:19:00,473 INFO L226 Difference]: Without dead ends: 79 [2021-11-20 06:19:00,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=344, Invalid=2755, Unknown=21, NotChecked=1170, Total=4290 [2021-11-20 06:19:00,475 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 230 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:19:00,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 290 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 06:19:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-20 06:19:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2021-11-20 06:19:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:19:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2021-11-20 06:19:00,478 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 62 [2021-11-20 06:19:00,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:19:00,478 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2021-11-20 06:19:00,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:19:00,479 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2021-11-20 06:19:00,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-20 06:19:00,479 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:19:00,480 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] [2021-11-20 06:19:00,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-20 06:19:00,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:19:00,681 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:19:00,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:19:00,681 INFO L85 PathProgramCache]: Analyzing trace with hash 256575357, now seen corresponding path program 1 times [2021-11-20 06:19:00,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:19:00,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964415706] [2021-11-20 06:19:00,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:19:00,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:19:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:19:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:19:01,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:19:01,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964415706] [2021-11-20 06:19:01,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964415706] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:19:01,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913058360] [2021-11-20 06:19:01,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:19:01,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:19:01,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:19:01,940 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:19:01,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-20 06:19:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:19:02,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 74 conjunts are in the unsatisfiable core [2021-11-20 06:19:02,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:19:02,047 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-11-20 06:19:02,176 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:19:02,176 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-11-20 06:19:02,251 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 13 treesize of output 9 [2021-11-20 06:19:02,259 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 13 treesize of output 9 [2021-11-20 06:19:02,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:19:02,332 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 23 treesize of output 22 [2021-11-20 06:19:02,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:19:02,342 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 23 treesize of output 22 [2021-11-20 06:19:02,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:19:02,467 INFO L354 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2021-11-20 06:19:02,467 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 3 case distinctions, treesize of input 119 treesize of output 94 [2021-11-20 06:19:02,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:19:02,487 INFO L354 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2021-11-20 06:19:02,487 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 3 case distinctions, treesize of input 109 treesize of output 90 [2021-11-20 06:19:03,028 INFO L354 Elim1Store]: treesize reduction 122, result has 18.7 percent of original size [2021-11-20 06:19:03,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 97 [2021-11-20 06:19:03,056 INFO L354 Elim1Store]: treesize reduction 112, result has 18.8 percent of original size [2021-11-20 06:19:03,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 82 [2021-11-20 06:19:03,571 INFO L354 Elim1Store]: treesize reduction 130, result has 17.7 percent of original size [2021-11-20 06:19:03,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 143 treesize of output 115 [2021-11-20 06:19:03,603 INFO L354 Elim1Store]: treesize reduction 140, result has 15.7 percent of original size [2021-11-20 06:19:03,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 85 [2021-11-20 06:19:04,359 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-20 06:19:04,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 82 [2021-11-20 06:19:04,380 INFO L354 Elim1Store]: treesize reduction 26, result has 39.5 percent of original size [2021-11-20 06:19:04,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2021-11-20 06:19:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 06:19:04,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:19:11,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_44| Int)) (or (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (< |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| 0) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_44|) (and (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_15 Int)) (<= 0 (+ (select (select (let ((.cse0 (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|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18))) (.cse1 (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_17) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_DerPreprocessor_15))) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int) (v_prenex_9 Int)) (let ((.cse5 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_17))) (let ((.cse3 (select .cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (let ((.cse2 (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|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18)))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_9))) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse5))) (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_DerPreprocessor_16))) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))))) is different from false [2021-11-20 06:19:13,790 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_44| Int)) (or (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (< |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| 0) (and (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int) (v_prenex_9 Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_17))) (let ((.cse1 (select .cse3 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_9))) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse3))) (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_DerPreprocessor_16))) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_15 Int)) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18))) (.cse5 (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_17) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_DerPreprocessor_15))) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 4)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_44|))) is different from false [2021-11-20 06:19:16,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_44| Int)) (or (and (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_15 Int)) (<= 0 (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18))) (.cse1 (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_17) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_DerPreprocessor_15))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 4))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int) (v_prenex_9 Int)) (let ((.cse5 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_17))) (let ((.cse3 (select .cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (<= (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18)))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_9))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 8) (select |c_#length| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse5))) (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_DerPreprocessor_16))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_44|) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (< |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| 0))) is different from false [2021-11-20 06:19:19,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_44| Int)) (or (and (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int) (v_prenex_9 Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_17))) (let ((.cse1 (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (<= (+ 8 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_9))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (select |c_#length| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3))) (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_DerPreprocessor_16))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_15 Int)) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18))) (.cse5 (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_17) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_DerPreprocessor_15))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))) (< |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| 0) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_44|))) is different from false [2021-11-20 06:19:19,474 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:19:19,474 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 367 treesize of output 371 [2021-11-20 06:19:22,725 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_44| Int)) (or (and (forall ((v_DerPreprocessor_17 Int) (v_prenex_9 Int)) (<= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18)))) (.cse1 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_17) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_9)))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (let ((.cse6 (store (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_17))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6)) (.cse5 (select .cse6 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_DerPreprocessor_16))))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (forall ((v_DerPreprocessor_15 Int) (v_prenex_10 Int)) (<= 0 (+ (select (select (let ((.cse10 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse8 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (store .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18)))) (.cse9 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_prenex_10) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_DerPreprocessor_15)))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))) (< (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (< |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_44|))) is different from false [2021-11-20 06:19:27,115 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_44| Int)) (or (and (forall ((v_DerPreprocessor_17 Int) (v_prenex_9 Int)) (<= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse0 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4 0)))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18)))) (.cse1 (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4 0)))) (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_17) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_9)))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse9 (store (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_17))) (let ((.cse7 (store .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse9)) (.cse8 (select .cse9 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_DerPreprocessor_16))))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (forall ((v_DerPreprocessor_15 Int) (v_prenex_10 Int)) (<= 0 (+ (select (select (let ((.cse15 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse16 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse12 (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse16 0)))) (store .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (store .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18)))) (.cse13 (select (store (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse16 0)))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_prenex_10) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse12 .cse13 (store (select .cse12 .cse13) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_DerPreprocessor_15)))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))) (< |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| 0) (< (select (store (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_18) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_44|))) is different from false [2021-11-20 06:19:27,661 INFO L354 Elim1Store]: treesize reduction 173, result has 29.4 percent of original size [2021-11-20 06:19:27,662 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 4 case distinctions, treesize of input 484829 treesize of output 482780 [2021-11-20 06:19:41,519 WARN L227 SmtUtils]: Spent 13.85s on a formula simplification. DAG size of input: 832 DAG size of output: 832 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:19:41,790 INFO L354 Elim1Store]: treesize reduction 185, result has 24.5 percent of original size [2021-11-20 06:19:41,793 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 4 case distinctions, treesize of input 541841 treesize of output 389004 [2021-11-20 06:19:48,051 WARN L227 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:19:48,116 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:19:48,117 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 388108 treesize of output 380476 [2021-11-20 06:19:49,660 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:19:49,662 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 380476 treesize of output 380474 [2021-11-20 06:19:51,372 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-20 06:19:51,372 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:19:51,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2021-11-20 06:19:51,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050898584] [2021-11-20 06:19:51,373 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-20 06:19:51,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 06:19:51,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:19:51,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 06:19:51,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3193, Unknown=7, NotChecked=714, Total=4160 [2021-11-20 06:19:51,375 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:19:55,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:19:55,172 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2021-11-20 06:19:55,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-20 06:19:55,173 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-20 06:19:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:19:55,173 INFO L225 Difference]: With dead ends: 83 [2021-11-20 06:19:55,173 INFO L226 Difference]: Without dead ends: 83 [2021-11-20 06:19:55,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=707, Invalid=5630, Unknown=7, NotChecked=966, Total=7310 [2021-11-20 06:19:55,176 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 403 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 06:19:55,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 329 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-20 06:19:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-11-20 06:19:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2021-11-20 06:19:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:19:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2021-11-20 06:19:55,179 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 62 [2021-11-20 06:19:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:19:55,180 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2021-11-20 06:19:55,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:19:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2021-11-20 06:19:55,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-20 06:19:55,181 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:19:55,181 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-11-20 06:19:55,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-20 06:19:55,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:19:55,396 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:19:55,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:19:55,396 INFO L85 PathProgramCache]: Analyzing trace with hash -636099954, now seen corresponding path program 1 times [2021-11-20 06:19:55,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:19:55,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888271898] [2021-11-20 06:19:55,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:19:55,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:19:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:19:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:19:56,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:19:56,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888271898] [2021-11-20 06:19:56,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888271898] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:19:56,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484950683] [2021-11-20 06:19:56,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:19:56,727 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:19:56,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:19:56,731 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:19:56,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-20 06:19:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:19:56,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-20 06:19:56,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:19:56,873 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-11-20 06:19:57,055 INFO L354 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2021-11-20 06:19:57,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 29 [2021-11-20 06:19:57,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-20 06:19:57,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:19:57,329 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 23 treesize of output 22 [2021-11-20 06:19:57,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:19:57,481 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-11-20 06:19:57,481 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 2 case distinctions, treesize of input 56 treesize of output 43 [2021-11-20 06:19:58,157 INFO L354 Elim1Store]: treesize reduction 102, result has 19.0 percent of original size [2021-11-20 06:19:58,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 45 [2021-11-20 06:19:58,470 INFO L354 Elim1Store]: treesize reduction 92, result has 35.2 percent of original size [2021-11-20 06:19:58,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 68 [2021-11-20 06:20:00,543 INFO L354 Elim1Store]: treesize reduction 44, result has 27.9 percent of original size [2021-11-20 06:20:00,543 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 72 treesize of output 76 [2021-11-20 06:20:01,408 INFO L354 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2021-11-20 06:20:01,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 63 [2021-11-20 06:20:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 06:20:01,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:21:49,662 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 46244 treesize of output 45988 [2021-11-20 06:22:33,768 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 9 refuted. 9 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 06:22:33,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484950683] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:22:33,769 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:22:33,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22, 21] total 64 [2021-11-20 06:22:33,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993313509] [2021-11-20 06:22:33,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:22:33,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-11-20 06:22:33,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:22:33,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-11-20 06:22:33,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=3623, Unknown=64, NotChecked=0, Total=4032 [2021-11-20 06:22:33,771 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 64 states, 64 states have (on average 2.75) internal successors, (176), 64 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:22:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:22:37,942 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2021-11-20 06:22:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-20 06:22:37,943 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.75) internal successors, (176), 64 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-20 06:22:37,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:22:37,944 INFO L225 Difference]: With dead ends: 80 [2021-11-20 06:22:37,944 INFO L226 Difference]: Without dead ends: 80 [2021-11-20 06:22:37,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 105 SyntacticMatches, 13 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2234 ImplicationChecksByTransitivity, 152.2s TimeCoverageRelationStatistics Valid=843, Invalid=7283, Unknown=64, NotChecked=0, Total=8190 [2021-11-20 06:22:37,946 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 108 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:22:37,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 665 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 346 Invalid, 0 Unknown, 205 Unchecked, 0.4s Time] [2021-11-20 06:22:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-11-20 06:22:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2021-11-20 06:22:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 76 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:22:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2021-11-20 06:22:37,950 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 63 [2021-11-20 06:22:37,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:22:37,950 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2021-11-20 06:22:37,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.75) internal successors, (176), 64 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:22:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2021-11-20 06:22:37,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-20 06:22:37,952 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:22:37,952 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-11-20 06:22:37,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-11-20 06:22:38,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:22:38,168 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:22:38,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:22:38,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1405249969, now seen corresponding path program 1 times [2021-11-20 06:22:38,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:22:38,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725341986] [2021-11-20 06:22:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:22:38,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:22:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:22:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:22:39,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:22:39,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725341986] [2021-11-20 06:22:39,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725341986] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:22:39,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031647522] [2021-11-20 06:22:39,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:22:39,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:22:39,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:22:39,733 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:22:39,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-20 06:22:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:22:39,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 57 conjunts are in the unsatisfiable core [2021-11-20 06:22:39,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:22:39,819 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-11-20 06:22:39,991 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:22:39,992 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-11-20 06:22:40,090 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 13 treesize of output 9 [2021-11-20 06:22:40,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:22:40,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:22:40,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:22:40,314 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-11-20 06:22:40,314 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 3 case distinctions, treesize of input 54 treesize of output 41 [2021-11-20 06:22:41,079 INFO L354 Elim1Store]: treesize reduction 102, result has 19.0 percent of original size [2021-11-20 06:22:41,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 43 [2021-11-20 06:22:41,628 INFO L354 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2021-11-20 06:22:41,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 57 [2021-11-20 06:22:42,137 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:22:42,138 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 3 case distinctions, treesize of input 32 treesize of output 34 [2021-11-20 06:22:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 06:22:42,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:23:24,800 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_update_at_~head#1.offset| Int) (v_DerPreprocessor_21 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| v_DerPreprocessor_21)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|)) is different from false [2021-11-20 06:23:26,749 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_55| Int) (v_DerPreprocessor_21 Int)) (<= (+ (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_dll_update_at_~head#1.offset_55| v_DerPreprocessor_21))) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|)) is different from false [2021-11-20 06:23:28,734 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_55| Int) (v_DerPreprocessor_21 Int)) (<= (+ (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_dll_update_at_~head#1.offset_55| v_DerPreprocessor_21))) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|)) is different from false [2021-11-20 06:23:30,759 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_55| Int) (v_DerPreprocessor_21 Int)) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_DerPreprocessor_22)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_55| v_DerPreprocessor_21)))) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|)) is different from false [2021-11-20 06:23:32,787 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_55| Int) (v_DerPreprocessor_21 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_57| Int)) (or (<= (+ (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_57| v_DerPreprocessor_22))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_55| v_DerPreprocessor_21)))) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_57|))) is different from false [2021-11-20 06:23:34,812 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_55| Int) (v_DerPreprocessor_21 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_57| Int)) (or (<= (+ (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_57| v_DerPreprocessor_22))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse2)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_55| v_DerPreprocessor_21)))) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_57|))) is different from false [2021-11-20 06:23:36,845 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_55| Int) (v_DerPreprocessor_21 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_57| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_57|) (<= (+ (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_57| v_DerPreprocessor_22))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_55| v_DerPreprocessor_21)))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-11-20 06:23:38,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_55| Int) (v_DerPreprocessor_21 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_57| Int)) (or (<= (+ 1 (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_57| v_DerPreprocessor_22))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_55| v_DerPreprocessor_21)))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_57|))) is different from false [2021-11-20 06:23:40,916 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_22 Int) (|ULTIMATE.start_dll_create_~head~0#1.offset| Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_55| Int) (v_DerPreprocessor_21 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_57| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_57|) (<= (+ (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (let ((.cse2 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_57| v_DerPreprocessor_22))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_55| v_DerPreprocessor_21))))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-11-20 06:23:42,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_22 Int) (|ULTIMATE.start_dll_create_~head~0#1.offset| Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_55| Int) (v_DerPreprocessor_21 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_57| Int)) (or (<= (+ (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse2 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_57| v_DerPreprocessor_22))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_55| v_DerPreprocessor_21))))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_57|))) is different from false [2021-11-20 06:23:43,151 INFO L354 Elim1Store]: treesize reduction 174, result has 29.0 percent of original size [2021-11-20 06:23:43,152 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 4 case distinctions, treesize of input 17773 treesize of output 7571 [2021-11-20 06:23:43,195 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:23:43,196 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 7571 treesize of output 7059 [2021-11-20 06:23:43,234 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-20 06:23:43,234 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:43,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2021-11-20 06:23:43,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961160509] [2021-11-20 06:23:43,234 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-20 06:23:43,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-20 06:23:43,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:43,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-20 06:23:43,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2246, Unknown=28, NotChecked=1050, Total=3540 [2021-11-20 06:23:43,236 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:23:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:47,401 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2021-11-20 06:23:47,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-20 06:23:47,401 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-20 06:23:47,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:47,402 INFO L225 Difference]: With dead ends: 78 [2021-11-20 06:23:47,402 INFO L226 Difference]: Without dead ends: 78 [2021-11-20 06:23:47,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 66.0s TimeCoverageRelationStatistics Valid=641, Invalid=4483, Unknown=28, NotChecked=1490, Total=6642 [2021-11-20 06:23:47,403 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 306 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:47,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 336 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-20 06:23:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-20 06:23:47,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-11-20 06:23:47,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 77 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:23:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2021-11-20 06:23:47,406 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 65 [2021-11-20 06:23:47,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:47,407 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2021-11-20 06:23:47,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:23:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2021-11-20 06:23:47,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-20 06:23:47,408 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:47,408 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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] [2021-11-20 06:23:47,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:47,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-11-20 06:23:47,628 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-11-20 06:23:47,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:47,628 INFO L85 PathProgramCache]: Analyzing trace with hash -755420895, now seen corresponding path program 2 times [2021-11-20 06:23:47,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:47,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965449665] [2021-11-20 06:23:47,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:47,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:23:49,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:49,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965449665] [2021-11-20 06:23:49,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965449665] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:49,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234940829] [2021-11-20 06:23:49,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:23:49,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:49,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:49,628 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:49,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c202b025-793e-4629-8741-fc7b4af0566e/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-20 06:23:49,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:23:49,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:23:49,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 88 conjunts are in the unsatisfiable core [2021-11-20 06:23:49,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:49,773 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-11-20 06:23:49,825 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-11-20 06:23:49,834 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-11-20 06:23:49,857 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 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-20 06:23:49,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:23:49,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:23:49,864 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 18 treesize of output 22 [2021-11-20 06:23:49,876 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 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-20 06:23:49,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:23:49,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:23:49,885 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 18 treesize of output 22 [2021-11-20 06:23:50,124 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:23:50,125 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-11-20 06:23:50,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-20 06:23:50,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-20 06:23:50,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-11-20 06:23:50,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-11-20 06:23:50,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:23:50,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-11-20 06:23:50,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:23:50,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-11-20 06:23:50,801 INFO L354 Elim1Store]: treesize reduction 151, result has 12.7 percent of original size [2021-11-20 06:23:50,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 124 treesize of output 96 [2021-11-20 06:23:50,854 INFO L354 Elim1Store]: treesize reduction 139, result has 15.8 percent of original size [2021-11-20 06:23:50,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 105 treesize of output 93 [2021-11-20 06:23:51,809 INFO L354 Elim1Store]: treesize reduction 164, result has 21.5 percent of original size [2021-11-20 06:23:51,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 119 treesize of output 119 [2021-11-20 06:23:51,886 INFO L354 Elim1Store]: treesize reduction 104, result has 26.2 percent of original size [2021-11-20 06:23:51,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 100 treesize of output 92 [2021-11-20 06:23:54,336 INFO L354 Elim1Store]: treesize reduction 168, result has 32.3 percent of original size [2021-11-20 06:23:54,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 169 treesize of output 191 [2021-11-20 06:23:54,555 INFO L354 Elim1Store]: treesize reduction 152, result has 38.7 percent of original size [2021-11-20 06:23:54,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 171 treesize of output 221 [2021-11-20 06:24:35,300 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-20 06:24:35,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 108 treesize of output 76 [2021-11-20 06:24:35,344 INFO L354 Elim1Store]: treesize reduction 48, result has 26.2 percent of original size [2021-11-20 06:24:35,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 52 [2021-11-20 06:24:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-20 06:24:35,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:25:24,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_60| Int) (v_DerPreprocessor_26 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_26) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_60|) (and (forall ((v_DerPreprocessor_24 Int) (v_DerPreprocessor_25 Int) (v_DerPreprocessor_23 Int)) (= (select (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_25))) (let ((.cse1 (select .cse3 4))) (select (let ((.cse0 (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|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_26)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_23))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3))) (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_24))) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) 4) 0)) (forall ((v_DerPreprocessor_25 Int) (v_prenex_13 Int)) (= (select (let ((.cse4 (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_25))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse7)) (.cse6 (select .cse7 4))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_prenex_13)))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0))))) is different from false [2021-11-20 06:25:26,485 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_60| Int) (v_DerPreprocessor_26 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_60|) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_26) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|) (and (forall ((v_DerPreprocessor_25 Int) (v_prenex_13 Int)) (= (select (let ((.cse0 (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_25))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_prenex_13)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) 4) 0)) (forall ((v_DerPreprocessor_24 Int) (v_DerPreprocessor_25 Int) (v_DerPreprocessor_23 Int)) (= (select (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_25))) (let ((.cse5 (select .cse7 4))) (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_26)))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_23))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse7))) (store .cse6 .cse5 (store (select .cse6 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_24))) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))) 4) 0))))) is different from false [2021-11-20 06:25:28,635 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_60| Int) (v_DerPreprocessor_26 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_26) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|) (and (forall ((v_DerPreprocessor_24 Int) (v_DerPreprocessor_25 Int) (v_DerPreprocessor_23 Int)) (= (select (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_25))) (let ((.cse1 (select .cse3 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_26)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_23))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse3))) (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_24))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))) 4) 0)) (forall ((v_DerPreprocessor_25 Int) (v_prenex_13 Int)) (= 0 (select (let ((.cse4 (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_25))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse7)) (.cse6 (select .cse7 4))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_prenex_13)))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) 4)))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_60|))) is different from false [2021-11-20 06:25:30,919 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_60| Int) (v_DerPreprocessor_26 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (and (forall ((v_DerPreprocessor_24 Int) (v_DerPreprocessor_25 Int) (v_DerPreprocessor_23 Int)) (= (select (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_25))) (let ((.cse1 (select .cse3 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_26)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_23))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3))) (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_24))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) 4) 0)) (forall ((v_DerPreprocessor_25 Int) (v_prenex_13 Int)) (= (select (let ((.cse4 (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_25))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7)) (.cse6 (select .cse7 4))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_prenex_13)))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_60|) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_26) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|))) is different from false [2021-11-20 06:25:33,112 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_60| Int) (v_DerPreprocessor_26 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_26) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_60|) (and (forall ((v_DerPreprocessor_24 Int) (v_DerPreprocessor_25 Int) (v_DerPreprocessor_23 Int)) (= (select (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_25))) (let ((.cse1 (select .cse6 4))) (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_26))))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_23))) (select (select (let ((.cse4 (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6))) (store .cse4 .cse1 (store (select .cse4 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_24))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) 4) 0)) (forall ((v_DerPreprocessor_25 Int) (v_prenex_13 Int)) (= (select (let ((.cse7 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_25))) (let ((.cse8 (store .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse10)) (.cse9 (select .cse10 4))) (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_prenex_13))))))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0))))) is different from false [2021-11-20 06:25:35,629 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_60| Int) (v_DerPreprocessor_26 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (and (forall ((v_DerPreprocessor_25 Int) (v_prenex_13 Int)) (= (select (let ((.cse0 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_25))) (let ((.cse1 (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_prenex_13))))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0)) (forall ((v_DerPreprocessor_24 Int) (v_DerPreprocessor_25 Int) (v_DerPreprocessor_23 Int)) (= (select (let ((.cse10 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse11 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse11 0)))) (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse14 (store (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_25))) (let ((.cse7 (select .cse14 4))) (select (let ((.cse6 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse11 0)))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (store .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_26))))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_23))) (select (select (let ((.cse12 (store .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse14))) (store .cse12 .cse7 (store (select .cse12 .cse7) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_24))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) 4) 0))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_60|) (< (select (store (select (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_26) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|))) is different from false [2021-11-20 06:27:16,553 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_60| Int) (v_DerPreprocessor_26 Int) (v_DerPreprocessor_27 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (< (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_DerPreprocessor_27) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_26) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|) (and (forall ((v_DerPreprocessor_25 Int) (v_DerPreprocessor_28 Int) (v_prenex_13 Int)) (= (select (let ((.cse1 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_DerPreprocessor_28) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_25))) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_prenex_13))))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0)) (forall ((v_DerPreprocessor_24 Int) (v_DerPreprocessor_23 Int) (v_DerPreprocessor_28 Int) (v_prenex_14 Int)) (= 0 (select (let ((.cse11 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse12 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse13 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse15 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_DerPreprocessor_28) .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse13 0)))) (store .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse16 (store (select .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_prenex_14))) (let ((.cse8 (select .cse16 4))) (select (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_DerPreprocessor_27) .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) .cse13 0)))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (store .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_60| v_DerPreprocessor_26))))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_23))) (select (select (let ((.cse14 (store .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse16))) (store .cse14 .cse8 (store (select .cse14 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_24))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) 4)))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_60|))) is different from false [2021-11-20 06:27:39,549 INFO L354 Elim1Store]: treesize reduction 9773, result has 12.4 percent of original size [2021-11-20 06:27:39,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 10778596 treesize of output 10698727 [2021-11-20 06:27:54,262 WARN L227 SmtUtils]: Spent 14.71s on a formula simplification. DAG size of input: 702 DAG size of output: 701 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:27:56,164 INFO L354 Elim1Store]: treesize reduction 966, result has 29.8 percent of original size [2021-11-20 06:27:56,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 24 case distinctions, treesize of input 1098726598 treesize of output 231759136